_{[0280 - Wiggle Sort](https://leetcode.com/problems/wiggle-sort/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0179 - Largest Number](https://leetcode.com/problems/largest-number/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0179-largest-number.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0179-largest-number.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](typescript%2F0179-largest-number.ts)</div>}

_{[0523 - Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0523-continuous-subarray-sum.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0523-continuous-subarray-sum.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F0523-continuous-subarray-sum.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0838 - Push Dominoes](https://leetcode.com/problems/push-dominoes/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](typescript%2F0838-push-dominoes.ts)</div>}

_{[0838 - Push Dominoes](https://leetcode.com/problems/push-dominoes/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0838-push-dominoes.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](typescript%2F0838-push-dominoes.ts)</div>}

_{[0187 - Repeated Dna Sequences](https://leetcode.com/problems/repeated-dna-sequences/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0187-repeated-dna-sequences.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0187-repeated-dna-sequences.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](typescript%2F0187-repeated-dna-sequences.ts)</div>}

_{[0380 - Insert Delete Get Random O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](go%2F0380-insert-delete-getrandom-o1.go)</div>} | _{<divalign='center'>[✔️](java%2F0380-insert-delete-getrandom-o1.java)</div>} | _{<divalign='center'>[✔️](javascript%2F0380-insert-delete-getrandom-o1.js)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](typescript%2F0380-insert-delete-getrandom-o1.ts)</div>}

_{[1461 - Check if a String Contains All Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

classSolution {

stringpushDominoes(string dominoes) {

string res ="";

char prev;

int n = dominoes.size(), count =1;

vector<int>left(n,0),right(n,0);

for (int i =0; i < n; i++) {

if (dominoes[i] =='R') { count =1; prev ='R'; }

elseif (dominoes[i] !='.') prev = dominoes[i];

if (prev =='R' && dominoes[i] =='.') right[i] = count++;

}

prev ='.';

for (int i = n-1; i >=0; i--) {

if (dominoes[i] =='L') { count =1; prev ='L'; }

elseif (dominoes[i] !='.') prev = dominoes[i];

if (prev =='L' && dominoes[i] =='.') left[i] = count++;

}

for (int i =0; i < n; i++) {

if (!left[i] && !right[i]) res += dominoes[i];

elseif (!left[i]) res +='R';

elseif (!right[i]) res +='L';

elseif (left[i] == right[i]) res +='.';

elseif (left[i] < right[i]) res +='L';

else res +='R';

}

return res;

}

};