You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
| 231 |[Power Of Two](https://leetcode.com/problems/power-of-two/)| Think of Bit Manipulations |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0231_power_of_two.js)| Python Solution |
36
+
| 231 |[Power Of Two](https://leetcode.com/problems/power-of-two/)| Think of Bit Manipulations |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0231_power_of_two.js)|[Python Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/python_solutions/0231_power_of_two.py)|
| 268 |[Missing Number](https://leetcode.com/problems/missing-number/)| Bit Manipulation is One of the Options |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0268_missing_number.js)| Python Solution |
41
41
| 300 |[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)| Compare two last nums in sequence and subsequence. If both are equal, length of LIS is increased by 1 |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0300_longest_increasing_subsequence.js)|[Python Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/python_solutions/0300_longest_common_subsequence.py)|
42
42
| 322 |[Coin Change](https://leetcode.com/problems/coin-change/)| Think how to use a knapsack problem |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0322_coin_change.js)|[Python Solution]()|
43
-
| 326 |[Power of Three](https://leetcode.com/problems/power-of-three/)||[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0326_power_of_three.js)| Python Solution |
44
-
| 342 |[Power of Four](https://leetcode.com/problems/power-of-four/)| Bit Manipulations |[JS Solutions](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0342_power_of_four.js)| Python Solution |
43
+
| 326 |[Power of Three](https://leetcode.com/problems/power-of-three/)||[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0326_power_of_three.js)|[Python Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/python_solutions/0326_power_of_three.py)|
44
+
| 342 |[Power of Four](https://leetcode.com/problems/power-of-four/)| Bit Manipulations |[JS Solutions](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0342_power_of_four.js)|[Python Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/python_solutions/0342_power_of_four.py)|
45
45
| 344 |[Reverse String](https://leetcode.com/problems/reverse-string/)| The entire logic for reversing a string is based on using the opposite directional two-pointer approach |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0344_reverse_string.js)|[Python Solution]()|
46
46
| 345 |[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/)||[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0345_reverse_vowels_of_a_string.js)|[Python Solution]()|
0 commit comments