Merge branch 'neetcode-gh:main' into 535Swift

Author: kabirdhillon7

README.md

@@ -67,7 +67,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0280 - Wiggle Sort](https://leetcode.com/problems/wiggle-sort/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0179 - Largest Number](https://leetcode.com/problems/largest-number/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0179-largest-number.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0179-largest-number.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0179-largest-number.ts)</div></sub>
 <sub>[0523 - Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0523-continuous-subarray-sum.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0523-continuous-subarray-sum.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0523-continuous-subarray-sum.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
-<sub>[0838 - Push Dominoes](https://leetcode.com/problems/push-dominoes/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0838-push-dominoes.ts)</div></sub>
+<sub>[0838 - Push Dominoes](https://leetcode.com/problems/push-dominoes/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0838-push-dominoes.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0838-push-dominoes.ts)</div></sub>
 <sub>[0187 - Repeated Dna Sequences](https://leetcode.com/problems/repeated-dna-sequences/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0187-repeated-dna-sequences.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0187-repeated-dna-sequences.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0187-repeated-dna-sequences.ts)</div></sub>
 <sub>[0380 - Insert Delete Get Random O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0380-insert-delete-getrandom-o1.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0380-insert-delete-getrandom-o1.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0380-insert-delete-getrandom-o1.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0380-insert-delete-getrandom-o1.ts)</div></sub>
 <sub>[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/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>

cpp/0838-push-dominoes.cpp

@@ -0,0 +1,39 @@
+/*
+    Time: O(n)
+    Space: O(n)
+*/
+
+class Solution {
+public:
+    string pushDominoes(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'; }
+            else if (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'; }
+            else if (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];
+            else if (!left[i]) res += 'R';
+            else if (!right[i]) res += 'L';
+            else if (left[i] == right[i]) res += '.';
+            else if (left[i] < right[i]) res += 'L';
+            else res += 'R';
+        }
+        
+        return res;
+    }
+};