docs: update README.md

Author: Saimon398

README.md

@@ -7,9 +7,9 @@ Here you can find solutions in JavaScript and Python languages for problems from
 |   1    |                                                   [Two Sum](https://leetcode.com/problems/two-sum/)                                                   |                                                                                             Use a hash table to keep track of the indices of the numbers you've encountered so far.                                                                                              |                          [JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0001_two_sum.js)                          |                    [Python Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/python_solutions/0001_two_sum.py)                     |
 |   3    |              [Longest Substring Without Repeating Chars](https://leetcode.com/problems/longest-substring-without-repeating-characters/)               |                                                                                                                What if index of the first occurrence might help?                                                                                                                 |                     [JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0003_longest_substring.js)                     |                                                                   Python Solution                                                                    |
 |   7    |                                           [Reverse Integer](https://leetcode.com/problems/reverse-integer/)                                           |                                                                                                                                                                                                                                                                                  |                      [JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0007_reverse_integer.js)                      |                                                                   Python Solution                                                                    |
-|   9    |                                         [Palindrome Number](https://leetcode.com/problems/palindrome-number/)                                         |                                                                                                           Use two pointers to make it work faster. Beware of overflow.                                                                                                           |                     [JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0009_palindrome_number.js)                     |                                                                   Python Solution                                                                    |
+|   9    |                                         [Palindrome Number](https://leetcode.com/problems/palindrome-number/)                                         |                                                                                                           Use two pointers to make it work faster. Beware of overflow.                                                                                                           |                     [JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0009_palindrome_number.js)                     |               [Python Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/python_solutions/0009_palindrome_number.py)                |
 |   20   |                                         [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)                                         |                                                  Use a stack of characters. When you encounter a closing bracket, check if the top of the stack was the opening for it. If yes, pop it from the stack. Otherwise, return false.                                                  |                     [JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0020_valid_parentheses.js)                     |                                                                   Python Solution                                                                    |
-|   28   |        [Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/)        |                                                                                                                                                                                                                                                                                  |          [JS Solution ](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0028_find_the_index_of_the_first_occurrence.js)          |                                                                   Python Solution                                                                    |
+|   28   |        [Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/)        |                                                                                                                                                                                                                                                                                  |          [JS Solution ](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0028_find_the_index_of_the_first_occurrence.js)          |     [Python Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/python_solutions/0028_find_the_index_of_the_first_occurrence.py)     |
 |   32   |                                 [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)                                 |                                                                                                                            Use a stack of characters.                                                                                                                            |                 [JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0032_longest_valid_parentheses.js)                 |                                                                 [Python Solution]()                                                                  |
 |   34   |   [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)   |                                                                                                                                  Binary Search                                                                                                                                   |  [JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0034_find_first_and_last_position_of_element_in_sorted_array.js)  |                                                                   Python Solution                                                                    |
 |   35   |                                    [Search Insert Position](https://leetcode.com/problems/search-insert-position/)                                    |                                                                                                                                Use binary search                                                                                                                                 |                  [JS Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0035_search_insert_position.js)                   |               [Python Solution](https://github.com/Saimon398/leetcode-solutions/blob/main/js_solutions/0035_search_insert_position.js)               |