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
Copy file name to clipboardExpand all lines: README.md
+4-4Lines changed: 4 additions & 4 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -25,10 +25,10 @@ Here you can find solutions in JavaScript and Python languages for problems from
25
25
| 88 |[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)| You can easily solve this problem if you simply think about two elements at a time rather than two arrays. We know that each of the individual arrays is sorted. What we don't know is how they will intertwine. Can we take a local decision and arrive at an optimal solution? |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0088_merge_sorted_array.js)| Python Solution |
26
26
| 122 |[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)| What should we do every time there is a valley followed by a peak in price? |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0122_best_time_to_buy_and_sell_stocks.js)| Python Solution |
27
27
| 125 |[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)| Use Two Pointers |[JS Solutions](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0125_valid_palindrome.js)|[Python Solution]()|
28
-
| 136 |[Single Number](https://leetcode.com/problems/single-number/)| Use Bit Manipulations (XOR) |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0136_single_number.js)| Python Solution |
28
+
| 136 |[Single Number](https://leetcode.com/problems/single-number/)| Use Bit Manipulations (XOR) |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0136_single_number.js)|[Python Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/python_solutions/0136_single_number.py)|
29
29
| 151 |[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)||[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0151_reverse_words_in_a_string.js)| Python Solution |
| 191 |[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)| Use Bit Manipulations |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0191_number_of_1_bits.js)| Python Solution |
31
+
| 191 |[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)| Use Bit Manipulations |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0191_number_of_1_bits.js)|[Python Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/python_solutions/0191_number_of_1_bits.py)|
| 389 |[Find The Difference](https://leetcode.com/problems/find-the-difference/)||[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0389_find_the_difference.js)| Python Solution |
49
49
| 392 |[Is Subsequence](https://leetcode.com/problems/is-subsequence/)| Use two pointers to iterate through the two strings simultaneously. |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0392_is_subsequence.js)|[Python Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/python_solutions/0392_is_subsequence.py)|
50
-
| 412 |[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)| The first non-standard value must satisfy both conditions. |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0412_fizz_buzz.js)| Python Solution |
50
+
| 412 |[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)| The first non-standard value must satisfy both conditions. |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0412_fizz_buzz.js)|[Python Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/python_solutions/0412_fizz_buzz.py)|
51
51
| 421 |[Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/)||[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0421_maximum_xor_of_two_numbers_in_an_array.js)| Python Solution |
52
52
| 451 |[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/)||[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0451_sort_characters_by_frequency.js)| Python Solution |
| 461 |[Hamming Distance](https://leetcode.com/problems/hamming-distance/)| Bit Manipulation (XOR) |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0461_hamming_distance.js)|[Python Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/python_solutions/0461_hamming_distance.py)|
54
54
| 504 |[Base 7](https://leetcode.com/problems/base-7/)| Gorner's algorithm can help with this problem |[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0504_base7.js)| Python Solution |
| 557 |[Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/)||[JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0557_reverse_words_in_a_string_III.js)| Python Solution |
0 commit comments