Update README.md

Author: jjjllxx

README.md

@@ -42,15 +42,15 @@ Cpp version: [Leetcode-in-cpp](https://github.com/JinLexuan/Leetcode-in-cpp)
 [62. Unique Paths](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0062%20Unique%20Paths.md)  
 [63. Unique Paths II](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0063%20Unique%20Paths%20II.md)  
 [64. Minimum Path Sum](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0064%20Minimum%20Path%20Sum.md)  
-[70. Climbing Stairs](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0070%20Climbing%20Stairs.md)
+[70. Climbing Stairs](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0070%20Climbing%20Stairs.md)  
 [72. Edit Distance](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0072%20Edit%20Distance.md)  
 [91. Decode Ways](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0091%20Decode%20Ways.md)  
-[120. Triangle](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0120%20Triangle.md#120-triangle)
+[120. Triangle](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0120%20Triangle.md#120-triangle)  
 [121. Best Time to Buy and Sell Stock](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0121%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md)  
 [122. Best Time to Buy and Sell Stock II](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0122%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.md)  
 [139. Word Break](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0139%20Word%20Break.md)  
 [152. Maximum Product Subarray](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0152%20Maximum%20Product%20Subarray.md)  
-[198. House Robber](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0198%20House%20Robber.md)
+[198. House Robber](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0198%20House%20Robber.md)  
 [209. Minimum Size Subarray Sum](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0209%20Minimum%20Size%20Subarray%20Sum.md)  
 [213. House Robber II](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0213%20House%20Robber%20II.md)  
 [221. Maximal Square](https://github.com/JinLexuan/Leetcode-in-python/blob/main/dynamic%20programming/0221%20Maximal%20Square.md)  
@@ -90,11 +90,26 @@ Cpp version: [Leetcode-in-cpp](https://github.com/JinLexuan/Leetcode-in-cpp)
 [21. Merge Two Sorted Lists](https://github.com/JinLexuan/Leetcode-in-python/blob/main/linked%20list/0021%20Merge%20Two%20Sorted%20Lists.md#21-merge-two-sorted-lists)  
 [83. Remove Duplicates from Sorted List](https://github.com/JinLexuan/Leetcode-in-python/blob/main/linked%20list/0083%20Remove%20Duplicates%20from%20Sorted%20List.md)  
 [141. Linked List Cycle](https://github.com/JinLexuan/Leetcode-in-python/blob/main/linked%20list/0141%20Linked%20List%20Cycle.md)  
+[203. Remove Linked List Elements](https://github.com/JinLexuan/Leetcode-in-python/blob/main/linked%20list/0203%20Remove%20Linked%20List%20Elements.md)  
+[206. Reverse Linked List](https://github.com/JinLexuan/Leetcode-in-python/blob/main/linked%20list/0206%20Reverse%20Linked%20List.md)  
+[237. Delete Node in a Linked List](https://github.com/JinLexuan/Leetcode-in-python/blob/main/linked%20list/0237%20Delete%20Node%20in%20a%20Linked%20List.md)  
 
 ## math
 [29. Divide Two Integers](https://github.com/JinLexuan/Leetcode-in-python/blob/main/math/0029%20Divide%20Two%20Integers.md)  
 [118. Pascal's Triangle](https://github.com/JinLexuan/Leetcode-in-python/blob/main/math/0118%20Pascal's%20Triangle.md)  
 [119. Pascal's Triangle II](https://github.com/JinLexuan/Leetcode-in-python/blob/main/math/0119%20Pascal's%20Triangle%20II.md)  
+[202. Happy Number](https://github.com/JinLexuan/Leetcode-in-python/blob/main/math/0202%20Happy%20Number.md)  
+[263. Ugly Number](https://github.com/JinLexuan/Leetcode-in-python/blob/main/math/0263%20Ugly%20Number.md)  
+[279. Perfect Squares](https://github.com/JinLexuan/Leetcode-in-python/blob/main/math/0279%20Perfect%20Squares.md)  
+[292. Nim Game](https://github.com/JinLexuan/Leetcode-in-python/blob/main/math/0292%20Nim%20Game.md)  
+[319. Bulb Switcher](https://github.com/JinLexuan/Leetcode-in-python/blob/main/math/0319%20Bulb%20Switcher.md)  
+[367. Valid Perfect Square](https://github.com/JinLexuan/Leetcode-in-python/blob/main/math/0367%20Valid%20Perfect%20Square.md)  
+[372. Super Pow](https://github.com/JinLexuan/Leetcode-in-python/blob/main/math/0372%20Super%20Pow.md)  
+[400. Nth Digit](https://github.com/JinLexuan/Leetcode-in-python/blob/main/math/0400%20Nth%20Digit.md#400-nth-digit)  
+
+## prefix sum
+[238. Product of Array Except Self](https://github.com/JinLexuan/Leetcode-in-python/blob/main/prefix%20sum/0238%20Product%20of%20Array%20Except%20Self.md)  
+[304. Range Sum Query 2D - Immutable](https://github.com/JinLexuan/Leetcode-in-python/blob/main/prefix%20sum/0304%20Range%20Sum%20Query%202D%20-%20Immutable.md)  
 
 ## queue & stack
 [20. Valid Parentheses](https://github.com/JinLexuan/Leetcode-in-python/blob/main/queue%20%26%20stack/0020%20Valid%20Parentheses.md)  
@@ -110,6 +125,8 @@ Cpp version: [Leetcode-in-cpp](https://github.com/JinLexuan/Leetcode-in-cpp)
 [14. Longest Common Prefix](https://github.com/JinLexuan/Leetcode-in-python/blob/main/string/0014%20Longest%20Common%20Prefix.md)  
 [38. Count and Say](https://github.com/JinLexuan/Leetcode-in-python/blob/main/string/0038%20Count%20and%20Say.md)  
 [151. Reverse Words in a String](https://github.com/JinLexuan/Leetcode-in-python/blob/main/string/0151%20Reverse%20Words%20in%20a%20String.md)  
+[205. Isomorphic Strings](https://github.com/JinLexuan/Leetcode-in-python/blob/main/string/0205%20Isomorphic%20Strings.md)  
+[242. Valid Anagram](https://github.com/JinLexuan/Leetcode-in-python/blob/main/string/0242%20Valid%20Anagram.md)  
 
 ## tree
 [94. Binary Tree Inorder Traversal](https://github.com/JinLexuan/Leetcode-in-python/blob/main/tree/0094%20Binary%20Tree%20Inorder%20Traversal.md)  
@@ -122,8 +139,13 @@ Cpp version: [Leetcode-in-cpp](https://github.com/JinLexuan/Leetcode-in-cpp)
 [116. Populating Next Right Pointers in Each Node](https://github.com/JinLexuan/Leetcode-in-python/blob/main/tree/0116%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node.md)  
 [144. Binary Tree Preorder Traversal](https://github.com/JinLexuan/Leetcode-in-python/blob/main/tree/0144%20Binary%20Tree%20Preorder%20Traversal.md)  
 [145. Binary Tree Postorder Traversal](https://github.com/JinLexuan/Leetcode-in-python/blob/main/tree/0145%20Binary%20Tree%20Postorder%20Traversal.md)  
+[226. Invert Binary Tree](https://github.com/JinLexuan/Leetcode-in-python/blob/main/tree/0226%20Invert%20Binary%20Tree.md)  
+[235. Lowest Common Ancestor of a Binary Search Tree](https://github.com/JinLexuan/Leetcode-in-python/blob/main/tree/0235%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.md)  
 
 ## two pointer
 [11. Container With Most Water](https://github.com/JinLexuan/Leetcode-in-python/blob/main/two%20pointer/0011%20Container%20With%20Most%20Water.md)  
 [42. Trapping Rain Water](https://github.com/JinLexuan/Leetcode-in-python/blob/main/two%20pointer/0042%20Trapping%20Rain%20Water.md)  
 [88. Merge Sorted Array](https://github.com/JinLexuan/Leetcode-in-python/blob/main/two%20pointer/0088%20Merge%20Sorted%20Array.md)  
+[167. Two Sum II - Input Array Is Sorted](https://github.com/JinLexuan/Leetcode-in-python/blob/main/two%20pointer/0167%20Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted.md)  
+[283. Move Zeroes](https://github.com/JinLexuan/Leetcode-in-python/blob/main/two%20pointer/0283%20Move%20Zeroes.md)  
+[344. Reverse String](https://github.com/JinLexuan/Leetcode-in-python/blob/main/two%20pointer/0344%20Reverse%20String.md)