# leetcode **Repository Path**: hugh_sun/leetcode ## Basic Information - **Project Name**: leetcode - **Description**: leetcode 刷题 - **Primary Language**: Java - **License**: MIT - **Default Branch**: master - **Homepage**: None - **GVP Project**: No ## Statistics - **Stars**: 0 - **Forks**: 0 - **Created**: 2019-04-07 - **Last Updated**: 2022-09-25 ## Categories & Tags **Categories**: Uncategorized **Tags**: None ## README # Leetcode Leetcode solution
[1. Two Sum.md](./easy/1.%20Two%20Sum.md) [easy]
[2. Add Two Numbers.md](./medium/2.%20Add%20Two%20Numbers.md) [medium]
[3. Longest Substring Without Repeating Characters.md](./medium/3.%20Longest%20Substring%20Without%20Repeating%20Characters.md) [medium]
[5. Longest Palindromic Substring.md](./medium/5.%20Longest%20Palindromic%20Substring.md) [medium]
[6. ZigZag Conversion.md](./medium/6.%20ZigZag%20Conversion.md) [medium]
[7. Reverse Integer.md](./easy/7.%20Reverse%20Integer.md) [easy]
[8. String to Integer (atoi).md](./medium/8.%20String%20to%20Integer%20%28atoi%29.md) [medium]
[9. Palindrome Number.md](./easy/9.%20Palindrome%20Number.md) [easy]
[11. Container With Most Water.md](./medium/11.%20Container%20With%20Most%20Water.md) [medium]
[12. Integer to Roman.md](./medium/12.%20Integer%20to%20Roman.md) [medium]
[15. 3Sum.md](./medium/15.%203Sum.md) [medium]
[16. 3Sum Closest.md](./medium/16.%203Sum%20Closest.md) [medium]
[17. Letter Combinations of a Phone Number.md](./medium/17.%20Letter%20Combinations%20of%20a%20Phone%20Number.md) [medium]
[18. 4Sum.md](./medium/18.%204Sum.md) [medium]
[19. Remove Nth Node From End of List.md](./medium/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.md) [medium]
[22. Generate Parentheses.md](./medium/22.%20Generate%20Parentheses.md) [medium]
[23. Merge k Sorted Lists.md](./hard/23.%20Merge%20k%20Sorted%20Lists.md) [hard]
[24. Swap Nodes in Pairs.md](./medium/24.%20Swap%20Nodes%20in%20Pairs.md) [medium]
[25. Reverse Nodes in k-Group.md](./hard/25.%20Reverse%20Nodes%20in%20k-Group.md) [hard]
[26. Remove Duplicates from Sorted Array.md](./easy/26.%20Remove%20Duplicates%20from%20Sorted%20Array.md) [easy]
[27. Remove Element.md](./easy/27.%20Remove%20Element.md) [easy]
[29. Divide Two Integers.md](./medium/29.%20Divide%20Two%20Integers.md) [medium]
[31. Next Permutation.md](./medium/31.%20Next%20Permutation.md) [medium]
[33. Search in Rotated Sorted Array.md](./medium/33.%20Search%20in%20Rotated%20Sorted%20Array.md) [medium]
[34. Find First and Last Position of Element in Sorted Array.md](./medium/34.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array.md) [medium]
[35. Search Insert Position.md](./easy/35.%20Search%20Insert%20Position.md) [easy]
[36. Valid Sudoku.md](./medium/36.%20Valid%20Sudoku.md) [medium]
[38. Count and Say.md](./easy/38.%20Count%20and%20Say.md) [easy]
[39. Combination Sum.md](./medium/39.%20Combination%20Sum.md) [medium]
[40. Combination Sum II.md](./medium/40.%20Combination%20Sum%20II.md) [medium]
[42. Trapping Rain Water.md](./hard/42.%20Trapping%20Rain%20Water.md) [hard]
[43. Multiply Strings.md](./medium/43.%20Multiply%20Strings.md) [medium]
[46. Permutations.md](./medium/46.%20Permutations.md) [medium]
[47. Permutations II.md](./medium/47.%20Permutations%20II.md) [medium]
[48. Rotate Image.md](./medium/48.%20Rotate%20Image.md) [medium]
[49. Group Anagrams.md](./medium/49.%20Group%20Anagrams.md) [medium]
[50. Pow(x, n).md](./medium/50.%20Pow%28x%2C%20n%29.md) [medium]
[53. Maximum Subarray.md](./easy/53.%20Maximum%20Subarray.md) [easy]
[54. Spiral Matrix.md](./medium/54.%20Spiral%20Matrix.md) [medium]
[55. Jump Game.md](./medium/55.%20Jump%20Game.md) [medium]
[56. Merge Intervals.md](./medium/56.%20Merge%20Intervals.md) [medium]
[57. Insert Interval.md](./hard/57.%20Insert%20Interval.md) [hard]
[58. Length of Last Word.md](./easy/58.%20Length%20of%20Last%20Word.md) [easy]
[59. Spiral Matrix II.md](./medium/59.%20Spiral%20Matrix%20II.md) [medium]
[60. Permutation Sequence.md](./medium/60.%20Permutation%20Sequence.md) [medium]
[61. Rotate List.md](./medium/61.%20Rotate%20List.md) [medium]
[62. Unique Paths.md](./medium/62.%20Unique%20Paths.md) [medium]
[63. Unique Paths II.md](./medium/63.%20Unique%20Paths%20II.md) [medium]
[64. Minimum Path Sum.md](./medium/64.%20Minimum%20Path%20Sum.md) [medium]
[66. Plus One.md](./easy/66.%20Plus%20One.md) [easy]
[67. Add Binary.md](./easy/67.%20Add%20Binary.md) [easy]
[69. Sqrt(x).md](./easy/69.%20Sqrt%28x%29.md) [easy]
[70. Climbing Stairs.md](./easy/70.%20Climbing%20Stairs.md) [easy]
[71. Simplify Path.md](./medium/71.%20Simplify%20Path.md) [medium]
[73. Set Matrix Zeroes.md](./medium/73.%20Set%20Matrix%20Zeroes.md) [medium]
[74. Search a 2D Matrix.md](./medium/74.%20Search%20a%202D%20Matrix.md) [medium]
[75. Sort Colors.md](./medium/75.%20Sort%20Colors.md) [medium]
[77. Combinations.md](./medium/77.%20Combinations.md) [medium]
[78. Subsets.md](./medium/78.%20Subsets.md) [medium]
[79. Word Search.md](./medium/79.%20Word%20Search.md) [medium]
[80. Remove Duplicates from Sorted Array II.md](./medium/80.%20Remove%20Duplicates%20from%20Sorted%20Array%20II.md) [medium]
[81. Search in Rotated Sorted Array II.md](./medium/81.%20Search%20in%20Rotated%20Sorted%20Array%20II.md) [medium]
[82. Remove Duplicates from Sorted List II.md](./medium/82.%20Remove%20Duplicates%20from%20Sorted%20List%20II.md) [medium]
[83. Remove Duplicates from Sorted List.md](./easy/83.%20Remove%20Duplicates%20from%20Sorted%20List.md) [easy]
[86. Partition List.md](./medium/86.%20Partition%20List.md) [medium]
[88. Merge Sorted Array.md](./easy/88.%20Merge%20Sorted%20Array.md) [easy]
[89. Gray Code.md](./medium/89.%20Gray%20Code.md) [medium]
[90. Subsets II.md](./medium/90.%20Subsets%20II.md) [medium]
[91. Decode Ways.md](./medium/91.%20Decode%20Ways.md) [medium]
[92. Reverse Linked List II.md](./medium/92.%20Reverse%20Linked%20List%20II.md) [medium]
[93. Restore IP Addresses.md](./medium/93.%20Restore%20IP%20Addresses.md) [medium]
[94. Binary Tree Inorder Traversal.md](./medium/94.%20Binary%20Tree%20Inorder%20Traversal.md) [medium]
[95. Unique Binary Search Trees II.md](./medium/95.%20Unique%20Binary%20Search%20Trees%20II.md) [medium]
[96. Unique Binary Search Trees.md](./medium/96.%20Unique%20Binary%20Search%20Trees.md) [medium]
[98. Validate Binary Search Tree.md](./medium/98.%20Validate%20Binary%20Search%20Tree.md) [medium]
[100. Same Tree.md](./easy/100.%20Same%20Tree.md) [easy]
[101. Symmetric Tree.md](./easy/101.%20Symmetric%20Tree.md) [easy]
[102. Binary Tree Level Order Traversal.md](./medium/102.%20Binary%20Tree%20Level%20Order%20Traversal.md) [medium]
[103. Binary Tree Zigzag Level Order Traversal.md](./medium/103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal.md) [medium]
[104. Maximum Depth of Binary Tree.md](./easy/104.%20Maximum%20Depth%20of%20Binary%20Tree.md) [easy]
[105. Construct Binary Tree from Preorder and Inorder Traversal.md](./medium/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.md) [medium]
[106. Construct Binary Tree from Inorder and Postorder Traversal.md](./medium/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal.md) [medium]
[107. Binary Tree Level Order Traversal II.md](./easy/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II.md) [easy]
[108. Convert Sorted Array to Binary Search Tree.md](./easy/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree.md) [easy]
[109. Convert Sorted List to Binary Search Tree.md](./medium/109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.md) [medium]
[110. Balanced Binary Tree.md](./easy/110.%20Balanced%20Binary%20Tree.md) [easy]
[111. Minimum Depth of Binary Tree.md](./easy/111.%20Minimum%20Depth%20of%20Binary%20Tree.md) [easy]
[112. Path Sum.md](./easy/112.%20Path%20Sum.md) [easy]
[113. Path Sum II.md](./medium/113.%20Path%20Sum%20II.md) [medium]
[114. Flatten Binary Tree to Linked List.md](./medium/114.%20Flatten%20Binary%20Tree%20to%20Linked%20List.md) [medium]
[116. Populating Next Right Pointers in Each Node.md](./medium/116.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node.md) [medium]
[117. Populating Next Right Pointers in Each Node II.md](./medium/117.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II.md) [medium]
[118. Pascal's Triangle.md](./easy/118.%20Pascal%27s%20Triangle.md) [easy]
[119. Pascal's Triangle II.md](./easy/119.%20Pascal%27s%20Triangle%20II.md) [easy]
[120. Triangle.md](./medium/120.%20Triangle.md) [medium]
[121. Best Time to Buy and Sell Stock.md](./easy/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md) [easy]
[122. Best Time to Buy and Sell Stock II.md](./easy/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.md) [easy]
[125. Valid Palindrome.md](./easy/125.%20Valid%20Palindrome.md) [easy]
[127. Word Ladder.md](./medium/127.%20Word%20Ladder.md) [medium]
[129. Sum Root to Leaf Numbers.md](./medium/129.%20Sum%20Root%20to%20Leaf%20Numbers.md) [medium]
[130. Surrounded Regions.md](./medium/130.%20Surrounded%20Regions.md) [medium]
[131. Palindrome Partitioning.md](./medium/131.%20Palindrome%20Partitioning.md) [medium]
[133. Clone Graph.md](./medium/133.%20Clone%20Graph.md) [medium]
[134. Gas Station.md](./medium/134.%20Gas%20Station.md) [medium]
[136. Single Number.md](./easy/136.%20Single%20Number.md) [easy]
[137. Single Number II.md](./medium/137.%20Single%20Number%20II.md) [medium]
[138. Copy List with Random Pointer.md](./medium/138.%20Copy%20List%20with%20Random%20Pointer.md) [medium]
[139. Word Break.md](./medium/139.%20Word%20Break.md) [medium]
[141. Linked List Cycle.md](./easy/141.%20Linked%20List%20Cycle.md) [easy]
[143. Reorder List.md](./medium/143.%20Reorder%20List.md) [medium]
[144. Binary Tree Preorder Traversal.md](./medium/144.%20Binary%20Tree%20Preorder%20Traversal.md) [medium]
[146. LRU Cache.md](./medium/146.%20LRU%20Cache.md) [medium]
[147. Insertion Sort List.md](./medium/147.%20Insertion%20Sort%20List.md) [medium]
[148. Sort List.md](./medium/148.%20Sort%20List.md) [medium]
[150. Evaluate Reverse Polish Notation.md](./medium/150.%20Evaluate%20Reverse%20Polish%20Notation.md) [medium]
[151. Reverse Words in a String.md](./medium/151.%20Reverse%20Words%20in%20a%20String.md) [medium]
[152. Maximum Product Subarray.md](./medium/152.%20Maximum%20Product%20Subarray.md) [medium]
[155. Min Stack.md](./easy/155.%20Min%20Stack.md) [easy]
[160. Intersection of Two Linked Lists.md](./easy/160.%20Intersection%20of%20Two%20Linked%20Lists.md) [easy]
[162. Find Peak Element.md](./medium/162.%20Find%20Peak%20Element.md) [medium]
[165. Compare Version Numbers.md](./medium/165.%20Compare%20Version%20Numbers.md) [medium]
[166. Fraction to Recurring Decimal.md](./medium/166.%20Fraction%20to%20Recurring%20Decimal.md) [medium]
[167. Two Sum II - Input array is sorted.md](./easy/167.%20Two%20Sum%20II%20-%20Input%20array%20is%20sorted.md) [easy]
[168. Excel Sheet Column Title.md](./easy/168.%20Excel%20Sheet%20Column%20Title.md) [easy]
[169. Majority Element.md](./easy/169.%20Majority%20Element.md) [easy]
[171. Excel Sheet Column Number.md](./easy/171.%20Excel%20Sheet%20Column%20Number.md) [easy]
[172. Factorial Trailing Zeroes.md](./easy/172.%20Factorial%20Trailing%20Zeroes.md) [easy]
[173. Binary Search Tree Iterator.md](./medium/173.%20Binary%20Search%20Tree%20Iterator.md) [medium]
[175. Combine Two Tables.md](./easy/175.%20Combine%20Two%20Tables.md) [easy]
[176. Second Highest Salary.md](./easy/176.%20Second%20Highest%20Salary.md) [easy]
[177. Nth Highest Salary.md](./medium/177.%20Nth%20Highest%20Salary.md) [medium]
[178. Rank Scores.md](./medium/178.%20Rank%20Scores.md) [medium]
[179. Largest Number.md](./medium/179.%20Largest%20Number.md) [medium]
[180. Consecutive Numbers.md](./medium/180.%20Consecutive%20Numbers.md) [medium]
[181. Employees Earning More Than Their Managers.md](./easy/181.%20Employees%20Earning%20More%20Than%20Their%20Managers.md) [easy]
[182. Duplicate Emails.md](./easy/182.%20Duplicate%20Emails.md) [easy]
[183. Customers Who Never Order.md](./easy/183.%20Customers%20Who%20Never%20Order.md) [easy]
[184. Department Highest Salary.md](./medium/184.%20Department%20Highest%20Salary.md) [medium]
[187. Repeated DNA Sequences.md](./medium/187.%20Repeated%20DNA%20Sequences.md) [medium]
[189. Rotate Array.md](./easy/189.%20Rotate%20Array.md) [easy]
[190. Reverse Bits.md](./easy/190.%20Reverse%20Bits.md) [easy]
[191. Number of 1 Bits.md](./easy/191.%20Number%20of%201%20Bits.md) [easy]
[193. Valid Phone Numbers.md](./easy/193.%20Valid%20Phone%20Numbers.md) [easy]
[195. Tenth Line.md](./easy/195.%20Tenth%20Line.md) [easy]
[196. Delete Duplicate Emails.md](./easy/196.%20Delete%20Duplicate%20Emails.md) [easy]
[197. Rising Temperature.md](./easy/197.%20Rising%20Temperature.md) [easy]
[198. House Robber.md](./easy/198.%20House%20Robber.md) [easy]
[199. Binary Tree Right Side View.md](./medium/199.%20Binary%20Tree%20Right%20Side%20View.md) [medium]
[200. Number of Islands.md](./medium/200.%20Number%20of%20Islands.md) [medium]
[201. Bitwise AND of Numbers Range.md](./medium/201.%20Bitwise%20AND%20of%20Numbers%20Range.md) [medium]
[202. Happy Number.md](./easy/202.%20Happy%20Number.md) [easy]
[203. Remove Linked List Elements.md](./easy/203.%20Remove%20Linked%20List%20Elements.md) [easy]
[204. Count Primes.md](./easy/204.%20Count%20Primes.md) [easy]
[205. Isomorphic Strings.md](./easy/205.%20Isomorphic%20Strings.md) [easy]
[206. Reverse Linked List.md](./easy/206.%20Reverse%20Linked%20List.md) [easy]
[207. Course Schedule.md](./medium/207.%20Course%20Schedule.md) [medium]
[208. Implement Trie.md](./medium/208.%20Implement%20Trie.md) [medium]
[209. Minimum Size Subarray Sum.md](./medium/209.%20Minimum%20Size%20Subarray%20Sum.md) [medium]
[211. Add and Search Word - Data structure design.md](./medium/211.%20Add%20and%20Search%20Word%20-%20Data%20structure%20design.md) [medium]
[213. House Robber II.md](./medium/213.%20House%20Robber%20II.md) [medium]
[215. Kth Largest Element in an Array.md](./medium/215.%20Kth%20Largest%20Element%20in%20an%20Array.md) [medium]
[217. Contains Duplicate.md](./easy/217.%20Contains%20Duplicate.md) [easy]
[219. Contains Duplicate II.md](./easy/219.%20Contains%20Duplicate%20II.md) [easy]
[220. Contains Duplicate III.md](./medium/220.%20Contains%20Duplicate%20III.md) [medium]
[225. Implement Stack using Queues.md](./easy/225.%20Implement%20Stack%20using%20Queues.md) [easy]
[226. Invert Binary Tree.md](./easy/226.%20Invert%20Binary%20Tree.md) [easy]
[227. Basic Calculator II.md](./medium/227.%20Basic%20Calculator%20II.md) [medium]
[228. Summary Ranges.md](./medium/228.%20Summary%20Ranges.md) [medium]
[229. Majority Element II.md](./medium/229.%20Majority%20Element%20II.md) [medium]
[230. Kth Smallest Element in a BST.md](./medium/230.%20Kth%20Smallest%20Element%20in%20a%20BST.md) [medium]
[231. Power of Two.md](./easy/231.%20Power%20of%20Two.md) [easy]
[232. Implement Queue using Stacks.md](./easy/232.%20Implement%20Queue%20using%20Stacks.md) [easy]
[235. Lowest Common Ancestor of a Binary Search Tree.md](./easy/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.md) [easy]
[236. Lowest Common Ancestor of a Binary Tree.md](./medium/236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree.md) [medium]
[237. Delete Node in a Linked List.md](./easy/237.%20Delete%20Node%20in%20a%20Linked%20List.md) [easy]
[238. Product of Array Except Self.md](./medium/238.%20Product%20of%20Array%20Except%20Self.md) [medium]
[240. Search a 2D Matrix II.md](./medium/240.%20Search%20a%202D%20Matrix%20II.md) [medium]
[257. Binary Tree Paths.md](./easy/257.%20Binary%20Tree%20Paths.md) [easy]
[258. Add Digits.md](./easy/258.%20Add%20Digits.md) [easy]
[260. Single Number III.md](./medium/260.%20Single%20Number%20III.md) [medium]
[263. Ugly Number.md](./easy/263.%20Ugly%20Number.md) [easy]
[264. Ugly Number II.md](./medium/264.%20Ugly%20Number%20II.md) [medium]
[268. Missing Number.md](./easy/268.%20Missing%20Number.md) [easy]
[274. H-Index.md](./medium/274.%20H-Index.md) [medium]
[275. H-Index II.md](./medium/275.%20H-Index%20II.md) [medium]
[278. First Bad Version.md](./easy/278.%20First%20Bad%20Version.md) [easy]
[283. Move Zeroes.md](./easy/283.%20Move%20Zeroes.md) [easy]
[287. Find the Duplicate Number.md](./medium/287.%20Find%20the%20Duplicate%20Number.md) [medium]
[290. Word Pattern.md](./easy/290.%20Word%20Pattern.md) [easy]
[292. Nim Game.md](./easy/292.%20Nim%20Game.md) [easy]
[299. Bulls and Cows.md](./easy/299.%20Bulls%20and%20Cows.md) [easy]
[303. Range Sum Query - Immutable.md](./easy/303.%20Range%20Sum%20Query%20-%20Immutable.md) [easy]
[326. Power of Three.md](./easy/326.%20Power%20of%20Three.md) [easy]
[337. House Robber III.md](./medium/337.%20House%20Robber%20III.md) [medium]
[342. Power of Four.md](./easy/342.%20Power%20of%20Four.md) [easy]
[344. Reverse String.md](./easy/344.%20Reverse%20String.md) [easy]
[345. Reverse Vowels of a String.md](./easy/345.%20Reverse%20Vowels%20of%20a%20String.md) [easy]
[349. Intersection of Two Arrays.md](./easy/349.%20Intersection%20of%20Two%20Arrays.md) [easy]
[350. Intersection of Two Arrays II.md](./easy/350.%20Intersection%20of%20Two%20Arrays%20II.md) [easy]
[367. Valid Perfect Square.md](./easy/367.%20Valid%20Perfect%20Square.md) [easy]
[371. Sum of Two Integers.md](./easy/371.%20Sum%20of%20Two%20Integers.md) [easy]
[374. Guess Number Higher or Lower.md](./easy/374.%20Guess%20Number%20Higher%20or%20Lower.md) [easy]
[383. Ransom Note.md](./easy/383.%20Ransom%20Note.md) [easy]
[387. First Unique Character in a String.md](./easy/387.%20First%20Unique%20Character%20in%20a%20String.md) [easy]
[389. Find the Difference.md](./easy/389.%20Find%20the%20Difference.md) [easy]
[392. Is Subsequence.md](./easy/392.%20Is%20Subsequence.md) [easy]
[401. Binary Watch.md](./easy/401.%20Binary%20Watch.md) [easy]
[404. Sum of Left Leaves.md](./easy/404.%20Sum%20of%20Left%20Leaves.md) [easy]
[405. Convert a Number to Hexadecimal.md](./easy/405.%20Convert%20a%20Number%20to%20Hexadecimal.md) [easy]
[409. Longest Palindrome.md](./easy/409.%20Longest%20Palindrome.md) [easy]
[414. Third Maximum Number.md](./easy/414.%20Third%20Maximum%20Number.md) [easy]
[415. Add Strings.md](./easy/415.%20Add%20Strings.md) [easy]
[424. Longest Repeating Character Replacement.md](./medium/424.%20Longest%20Repeating%20Character%20Replacement.md) [medium]
[429. N-ary Tree Level Order Traversal.md](./easy/429.%20N-ary%20Tree%20Level%20Order%20Traversal.md) [easy]
[430. Flatten a Multilevel Doubly Linked List.md](./medium/430.%20Flatten%20a%20Multilevel%20Doubly%20Linked%20List.md) [medium]
[434. Number of Segments in a String.md](./easy/434.%20Number%20of%20Segments%20in%20a%20String.md) [easy]
[437. Path Sum III.md](./easy/437.%20Path%20Sum%20III.md) [easy]
[441. Arranging Coins.md](./easy/441.%20Arranging%20Coins.md) [easy]
[442. Find All Duplicates in an Array.md](./medium/442.%20Find%20All%20Duplicates%20in%20an%20Array.md) [medium]
[443. String Compression.md](./easy/443.%20String%20Compression.md) [easy]
[445. Add Two Numbers II.md](./medium/445.%20Add%20Two%20Numbers%20II.md) [medium]
[447. Number of Boomerangs.md](./easy/447.%20Number%20of%20Boomerangs.md) [easy]
[448. Find All Numbers Disappeared in an Array.md](./easy/448.%20Find%20All%20Numbers%20Disappeared%20in%20an%20Array.md) [easy]
[449. Serialize and Deserialize BST.md](./medium/449.%20Serialize%20and%20Deserialize%20BST.md) [medium]
[450. Delete Node in a BST.md](./medium/450.%20Delete%20Node%20in%20a%20BST.md) [medium]
[453. Minimum Moves to Equal Array Elements.md](./easy/453.%20Minimum%20Moves%20to%20Equal%20Array%20Elements.md) [easy]
[455. Assign Cookies.md](./easy/455.%20Assign%20Cookies.md) [easy]
[459. Repeated Substring Pattern.md](./easy/459.%20Repeated%20Substring%20Pattern.md) [easy]
[461. Hamming Distance.md](./easy/461.%20Hamming%20Distance.md) [easy]
[463. Island Perimeter.md](./easy/463.%20Island%20Perimeter.md) [easy]
[475. Heaters.md](./easy/475.%20Heaters.md) [easy]
[476. Number Complement.md](./easy/476.%20Number%20Complement.md) [easy]
[482. License Key Formatting.md](./easy/482.%20License%20Key%20Formatting.md) [easy]
[485. Max Consecutive Ones.md](./easy/485.%20Max%20Consecutive%20Ones.md) [easy]
[491. Increasing Subsequences.md](./medium/491.%20Increasing%20Subsequences.md) [medium]
[492. Construct the Rectangle.md](./easy/492.%20Construct%20the%20Rectangle.md) [easy]
[496. Next Greater Element I.md](./easy/496.%20Next%20Greater%20Element%20I.md) [easy]
[500. Keyboard Row.md](./easy/500.%20Keyboard%20Row.md) [easy]
[501. Find Mode in Binary Search Tree.md](./easy/501.%20Find%20Mode%20in%20Binary%20Search%20Tree.md) [easy]
[504. Base 7.md](./easy/504.%20Base%207.md) [easy]
[506. Relative Ranks.md](./easy/506.%20Relative%20Ranks.md) [easy]
[507. Perfect Number.md](./easy/507.%20Perfect%20Number.md) [easy]
[508. Most Frequent Subtree Sum.md](./medium/508.%20Most%20Frequent%20Subtree%20Sum.md) [medium]
[509. Fibonacci Number.md](./easy/509.%20Fibonacci%20Number.md) [easy]
[513. Find Bottom Left Tree Value.md](./medium/513.%20Find%20Bottom%20Left%20Tree%20Value.md) [medium]
[515. Find Largest Value in Each Tree Row.md](./medium/515.%20Find%20Largest%20Value%20in%20Each%20Tree%20Row.md) [medium]
[520. Detect Capital.md](./easy/520.%20Detect%20Capital.md) [easy]
[521. Longest Uncommon Subsequence I.md](./easy/521.%20Longest%20Uncommon%20Subsequence%20I.md) [easy]
[524. Longest Word in Dictionary through Deleting.md](./medium/524.%20Longest%20Word%20in%20Dictionary%20through%20Deleting.md) [medium]
[530. Minimum Absolute Difference in BST.md](./easy/530.%20Minimum%20Absolute%20Difference%20in%20BST.md) [easy]
[532. K-diff Pairs in an Array.md](./easy/532.%20K-diff%20Pairs%20in%20an%20Array.md) [easy]
[538. Convert BST to Greater Tree.md](./easy/538.%20Convert%20BST%20to%20Greater%20Tree.md) [easy]
[541. Reverse String II.md](./easy/541.%20Reverse%20String%20II.md) [easy]
[543. Diameter of Binary Tree.md](./easy/543.%20Diameter%20of%20Binary%20Tree.md) [easy]
[551. Student Attendance Record I.md](./easy/551.%20Student%20Attendance%20Record%20I.md) [easy]
[557. Reverse Words in a String III.md](./easy/557.%20Reverse%20Words%20in%20a%20String%20III.md) [easy]
[558. Quad Tree Intersection.md](./easy/558.%20Quad%20Tree%20Intersection.md) [easy]
[559. Maximum Depth of N-ary Tree.md](./easy/559.%20Maximum%20Depth%20of%20N-ary%20Tree.md) [easy]
[561. Array Partition I.md](./easy/561.%20Array%20Partition%20I.md) [easy]
[563. Binary Tree Tilt.md](./easy/563.%20Binary%20Tree%20Tilt.md) [easy]
[566. Reshape the Matrix.md](./easy/566.%20Reshape%20the%20Matrix.md) [easy]
[572. Subtree of Another Tree.md](./easy/572.%20Subtree%20of%20Another%20Tree.md) [easy]
[575. Distribute Candies.md](./easy/575.%20Distribute%20Candies.md) [easy]
[581. Shortest Unsorted Continuous Subarray.md](./easy/581.%20Shortest%20Unsorted%20Continuous%20Subarray.md) [easy]
[589. N-ary Tree Preorder Traversal.md](./easy/589.%20N-ary%20Tree%20Preorder%20Traversal.md) [easy]
[590. N-ary Tree Postorder Traversal.md](./easy/590.%20N-ary%20Tree%20Postorder%20Traversal.md) [easy]
[594. Longest Harmonious Subsequence.md](./easy/594.%20Longest%20Harmonious%20Subsequence.md) [easy]
[595. Big Countries.md](./easy/595.%20Big%20Countries.md) [easy]
[596. Classes More Than 5 Students.md](./easy/596.%20Classes%20More%20Than%205%20Students.md) [easy]
[598. Range Addition II.md](./easy/598.%20Range%20Addition%20II.md) [easy]
[599. Minimum Index Sum of Two Lists.md](./easy/599.%20Minimum%20Index%20Sum%20of%20Two%20Lists.md) [easy]
[605. Can Place Flowers.md](./easy/605.%20Can%20Place%20Flowers.md) [easy]
[606. Construct String from Binary Tree.md](./easy/606.%20Construct%20String%20from%20Binary%20Tree.md) [easy]
[617. Merge Two Binary Trees.md](./easy/617.%20Merge%20Two%20Binary%20Trees.md) [easy]
[620. Not Boring Movies.md](./easy/620.%20Not%20Boring%20Movies.md) [easy]
[623. Add One Row to Tree.md](./medium/623.%20Add%20One%20Row%20to%20Tree.md) [medium]
[627. Swap Salary.md](./easy/627.%20Swap%20Salary.md) [easy]
[628. Maximum Product of Three Numbers.md](./easy/628.%20Maximum%20Product%20of%20Three%20Numbers.md) [easy]
[633. Sum of Square Numbers.md](./easy/633.%20Sum%20of%20Square%20Numbers.md) [easy]
[637. Average of Levels in Binary Tree.md](./easy/637.%20Average%20of%20Levels%20in%20Binary%20Tree.md) [easy]
[643. Maximum Average Subarray I.md](./easy/643.%20Maximum%20Average%20Subarray%20I.md) [easy]
[645. Set Mismatch.md](./easy/645.%20Set%20Mismatch.md) [easy]
[652. Find Duplicate Subtrees.md](./medium/652.%20Find%20Duplicate%20Subtrees.md) [medium]
[653. Two Sum IV - Input is a BST.md](./easy/653.%20Two%20Sum%20IV%20-%20Input%20is%20a%20BST.md) [easy]
[654. Maximum Binary Tree.md](./medium/654.%20Maximum%20Binary%20Tree.md) [medium]
[657. Robot Return to Origin.md](./easy/657.%20Robot%20Return%20to%20Origin.md) [easy]
[658. Find K Closest Elements.md](./medium/658.%20Find%20K%20Closest%20Elements.md) [medium]
[661. Image Smoother.md](./easy/661.%20Image%20Smoother.md) [easy]
[662. Maximum Width of Binary Tree.md](./medium/662.%20Maximum%20Width%20of%20Binary%20Tree.md) [medium]
[665. Non-decreasing Array.md](./easy/665.%20Non-decreasing%20Array.md) [easy]
[669. Trim a Binary Search Tree.md](./easy/669.%20Trim%20a%20Binary%20Search%20Tree.md) [easy]
[671. Second Minimum Node In a Binary Tree.md](./easy/671.%20Second%20Minimum%20Node%20In%20a%20Binary%20Tree.md) [easy]
[674. Longest Continuous Increasing Subsequence.md](./easy/674.%20Longest%20Continuous%20Increasing%20Subsequence.md) [easy]
[680. Valid Palindrome II.md](./easy/680.%20Valid%20Palindrome%20II.md) [easy]
[682. Baseball Game.md](./easy/682.%20Baseball%20Game.md) [easy]
[686. Repeated String Match.md](./easy/686.%20Repeated%20String%20Match.md) [easy]
[687. Longest Univalue Path.md](./easy/687.%20Longest%20Univalue%20Path.md) [easy]
[690. Employee Importance.md](./easy/690.%20Employee%20Importance.md) [easy]
[693. Binary Number with Alternating Bits.md](./easy/693.%20Binary%20Number%20with%20Alternating%20Bits.md) [easy]
[696. Count Binary Substrings.md](./easy/696.%20Count%20Binary%20Substrings.md) [easy]
[697. Degree of an Array.md](./easy/697.%20Degree%20of%20an%20Array.md) [easy]
[700. Search in a Binary Search Tree.md](./easy/700.%20Search%20in%20a%20Binary%20Search%20Tree.md) [easy]
[701. Insert into a Binary Search Tree.md](./medium/701.%20Insert%20into%20a%20Binary%20Search%20Tree.md) [medium]
[703. Kth Largest Element in a Stream.md](./easy/703.%20Kth%20Largest%20Element%20in%20a%20Stream.md) [easy]
[704. Binary Search.md](./easy/704.%20Binary%20Search.md) [easy]
[705. Design HashSet.md](./easy/705.%20Design%20HashSet.md) [easy]
[706. Design HashMap.md](./easy/706.%20Design%20HashMap.md) [easy]
[707. Design Linked List.md](./easy/707.%20Design%20Linked%20List.md) [easy]
[709. To Lower Case.md](./easy/709.%20To%20Lower%20Case.md) [easy]
[717. 1-bit and 2-bit Characters.md](./easy/717.%201-bit%20and%202-bit%20Characters.md) [easy]
[720. Longest Word in Dictionary.md](./easy/720.%20Longest%20Word%20in%20Dictionary.md) [easy]
[724. Find Pivot Index.md](./easy/724.%20Find%20Pivot%20Index.md) [easy]
[725. Split Linked List in Parts.md](./medium/725.%20Split%20Linked%20List%20in%20Parts.md) [medium]
[728. Self Dividing Numbers.md](./easy/728.%20Self%20Dividing%20Numbers.md) [easy]
[733. Flood Fill.md](./easy/733.%20Flood%20Fill.md) [easy]
[744. Find Smallest Letter Greater Than Target.md](./easy/744.%20Find%20Smallest%20Letter%20Greater%20Than%20Target.md) [easy]
[747. Largest Number At Least Twice of Others.md](./easy/747.%20Largest%20Number%20At%20Least%20Twice%20of%20Others.md) [easy]
[748. Shortest Completing Word.md](./easy/748.%20Shortest%20Completing%20Word.md) [easy]
[752. Open the Lock.md](./medium/752.%20Open%20the%20Lock.md) [medium]
[754. Reach a Number.md](./easy/754.%20Reach%20a%20Number.md) [easy]
[762. Prime Number of Set Bits in Binary Representation.md](./easy/762.%20Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation.md) [easy]
[766. Toeplitz Matrix.md](./easy/766.%20Toeplitz%20Matrix.md) [easy]
[771. Jewels and Stones.md](./easy/771.%20Jewels%20and%20Stones.md) [easy]
[783. Minimum Distance Between BST Nodes.md](./easy/783.%20Minimum%20Distance%20Between%20BST%20Nodes.md) [easy]
[784. Letter Case Permutation.md](./easy/784.%20Letter%20Case%20Permutation.md) [easy]
[788. Rotated Digits.md](./easy/788.%20Rotated%20Digits.md) [easy]
[796. Rotate String.md](./easy/796.%20Rotate%20String.md) [easy]
[804. Unique Morse Code Words.md](./easy/804.%20Unique%20Morse%20Code%20Words.md) [easy]
[806. Number of Lines To Write String.md](./easy/806.%20Number%20of%20Lines%20To%20Write%20String.md) [easy]
[811. Subdomain Visit Count.md](./easy/811.%20Subdomain%20Visit%20Count.md) [easy]
[812. Largest Triangle Area.md](./easy/812.%20Largest%20Triangle%20Area.md) [easy]
[817. Linked List Components.md](./medium/817.%20Linked%20List%20Components.md) [medium]
[819. Most Common Word.md](./easy/819.%20Most%20Common%20Word.md) [easy]
[821. Shortest Distance to a Character.md](./easy/821.%20Shortest%20Distance%20to%20a%20Character.md) [easy]
[824. Goat Latin.md](./easy/824.%20Goat%20Latin.md) [easy]
[830. Positions of Large Groups.md](./easy/830.%20Positions%20of%20Large%20Groups.md) [easy]
[832. Flipping an Image.md](./easy/832.%20Flipping%20an%20Image.md) [easy]
[836. Rectangle Overlap.md](./easy/836.%20Rectangle%20Overlap.md) [easy]
[840. Magic Squares In Grid.md](./easy/840.%20Magic%20Squares%20In%20Grid.md) [easy]
[844. Backspace String Compare.md](./easy/844.%20Backspace%20String%20Compare.md) [easy]
[849. Maximize Distance to Closest Person.md](./easy/849.%20Maximize%20Distance%20to%20Closest%20Person.md) [easy]
[852. Peak Index in a Mountain Array.md](./easy/852.%20Peak%20Index%20in%20a%20Mountain%20Array.md) [easy]
[859. Buddy Strings.md](./easy/859.%20Buddy%20Strings.md) [easy]
[860. Lemonade Change.md](./easy/860.%20Lemonade%20Change.md) [easy]
[863. All Nodes Distance K in Binary Tree.md](./medium/863.%20All%20Nodes%20Distance%20K%20in%20Binary%20Tree.md) [medium]
[865. Smallest Subtree with all the Deepest Nodes.md](./medium/865.%20Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes.md) [medium]
[867. Transpose Matrix.md](./easy/867.%20Transpose%20Matrix.md) [easy]
[868. Binary Gap.md](./easy/868.%20Binary%20Gap.md) [easy]
[872. Leaf-Similar Trees.md](./easy/872.%20Leaf-Similar%20Trees.md) [easy]
[874. Walking Robot Simulation.md](./easy/874.%20Walking%20Robot%20Simulation.md) [easy]
[876. Middle of the Linked List.md](./easy/876.%20Middle%20of%20the%20Linked%20List.md) [easy]
[883. Projection Area of 3D Shapes.md](./easy/883.%20Projection%20Area%20of%203D%20Shapes.md) [easy]
[884. Uncommon Words from Two Sentences.md](./easy/884.%20Uncommon%20Words%20from%20Two%20Sentences.md) [easy]
[888. Fair Candy Swap.md](./easy/888.%20Fair%20Candy%20Swap.md) [easy]
[892. Surface Area of 3D Shapes.md](./easy/892.%20Surface%20Area%20of%203D%20Shapes.md) [easy]
[893. Groups of Special-Equivalent Strings.md](./easy/893.%20Groups%20of%20Special-Equivalent%20Strings.md) [easy]
[896. Monotonic Array.md](./easy/896.%20Monotonic%20Array.md) [easy]
[897. Increasing Order Search Tree.md](./easy/897.%20Increasing%20Order%20Search%20Tree.md) [easy]
[905. Sort Array By Parity.md](./easy/905.%20Sort%20Array%20By%20Parity.md) [easy]
[908. Smallest Range I.md](./easy/908.%20Smallest%20Range%20I.md) [easy]
[914. X of a Kind in a Deck of Cards.md](./easy/914.%20X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards.md) [easy]
[917. Reverse Only Letters.md](./easy/917.%20Reverse%20Only%20Letters.md) [easy]
[922. Sort Array By Parity II.md](./easy/922.%20Sort%20Array%20By%20Parity%20II.md) [easy]
[925. Long Pressed Name.md](./easy/925.%20Long%20Pressed%20Name.md) [easy]
[929. Unique Email Addresses.md](./easy/929.%20Unique%20Email%20Addresses.md) [easy]
[933. Number of Recent Calls.md](./easy/933.%20Number%20of%20Recent%20Calls.md) [easy]
[937. Reorder Data in Log Files.md](./easy/937.%20Reorder%20Data%20in%20Log%20Files.md) [easy]
[938. Range Sum of BST.md](./easy/938.%20Range%20Sum%20of%20BST.md) [easy]
[941. Valid Mountain Array.md](./easy/941.%20Valid%20Mountain%20Array.md) [easy]
[942. DI String Match.md](./easy/942.%20DI%20String%20Match.md) [easy]
[944. Delete Columns to Make Sorted.md](./easy/944.%20Delete%20Columns%20to%20Make%20Sorted.md) [easy]
[949. Largest Time for Given Digits.md](./easy/949.%20Largest%20Time%20for%20Given%20Digits.md) [easy]
[953. Verifying an Alien Dictionary.md](./easy/953.%20Verifying%20an%20Alien%20Dictionary.md) [easy]
[961. N-Repeated Element in Size 2N Array.md](./easy/961.%20N-Repeated%20Element%20in%20Size%202N%20Array.md) [easy]
[965. Univalued Binary Tree.md](./easy/965.%20Univalued%20Binary%20Tree.md) [easy]
[968. Binary Tree Cameras.md](./medium/968.%20Binary%20Tree%20Cameras.md) [medium]
[970. Powerful Integers.md](./easy/970.%20Powerful%20Integers.md) [easy]
[976. Largest Perimeter Triangle.md](./easy/976.%20Largest%20Perimeter%20Triangle.md) [easy]
[977. Squares of a Sorted Array.md](./easy/977.%20Squares%20of%20a%20Sorted%20Array.md) [easy]
[985. Sum of Even Numbers After Queries.md](./easy/985.%20Sum%20of%20Even%20Numbers%20After%20Queries.md) [easy]
[989. Add to Array-Form of Integer.md](./easy/989.%20Add%20to%20Array-Form%20of%20Integer.md) [easy]
[993. Cousins in Binary Tree.md](./easy/993.%20Cousins%20in%20Binary%20Tree.md) [easy]
[994. Rotting Oranges.md](./easy/994.%20Rotting%20Oranges.md) [easy]
[997. Find the Town Judge.md](./easy/997.%20Find%20the%20Town%20Judge.md) [easy]
[999. Available Captures for Rook.md](./easy/999.%20Available%20Captures%20for%20Rook.md) [easy]
[1002. Find Common Characters.md](./easy/1002.%20Find%20Common%20Characters.md) [easy]
[1005. Maximize Sum Of Array After K Negations.md](./easy/1005.%20Maximize%20Sum%20Of%20Array%20After%20K%20Negations.md) [easy]
[1009. Complement of Base 10 Integer.md](./easy/1009.%20Complement%20of%20Base%2010%20Integer.md) [easy]
[1010. Pairs of Songs With Total Durations Divisible by 60.md](./easy/1010.%20Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060.md) [easy]
[1013. Partition Array Into Three Parts With Equal Sum.md](./easy/1013.%20Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum.md) [easy]
[1018. Binary Prefix Divisible By 5.md](./easy/1018.%20Binary%20Prefix%20Divisible%20By%205.md) [easy]
[1019. Next Greater Node In Linked List.md](./medium/1019.%20Next%20Greater%20Node%20In%20Linked%20List.md) [medium]
[1021. Remove Outermost Parentheses.md](./easy/1021.%20Remove%20Outermost%20Parentheses.md) [easy]
[1022. Sum of Root To Leaf Binary Numbers.md](./easy/1022.%20Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers.md) [easy]
[1025. Divisor Game.md](./easy/1025.%20Divisor%20Game.md) [easy]
[1026. Maximum Difference Between Node and Ancestor.md](./medium/1026.%20Maximum%20Difference%20Between%20Node%20and%20Ancestor.md) [medium]
[1028. Recover a Tree From Preorder Traversal.md](./hard/1028.%20Recover%20a%20Tree%20From%20Preorder%20Traversal.md) [hard]
[1029. Two City Scheduling.md](./easy/1029.%20Two%20City%20Scheduling.md) [easy]
[1030. Matrix Cells in Distance Order.md](./easy/1030.%20Matrix%20Cells%20in%20Distance%20Order.md) [easy]
[1033. Moving Stones Until Consecutive.md](./easy/1033.%20Moving%20Stones%20Until%20Consecutive.md) [easy]
[1037. Valid Boomerang.md](./easy/1037.%20Valid%20Boomerang.md) [easy]
[1042. Flower Planting With No Adjacent.md](./easy/1042.%20Flower%20Planting%20With%20No%20Adjacent.md) [easy]
[1046. Last Stone Weight.md](./easy/1046.%20Last%20Stone%20Weight.md) [easy]
[1047. Remove All Adjacent Duplicates In String.md](./easy/1047.%20Remove%20All%20Adjacent%20Duplicates%20In%20String.md) [easy]
[1051. Height Checker.md](./easy/1051.%20Height%20Checker.md) [easy]
[1071. Greatest Common Divisor of Strings.md](./easy/1071.%20Greatest%20Common%20Divisor%20of%20Strings.md) [easy]
[1078. Occurrences After Bigram.md](./easy/1078.%20Occurrences%20After%20Bigram.md) [easy]
[1089. Duplicate Zeros.md](./easy/1089.%20Duplicate%20Zeros.md) [easy]
[1103. Distribute Candies to People.md](./easy/1103.%20Distribute%20Candies%20to%20People.md) [easy]
[1108. Defanging an IP Address.md](./easy/1108.%20Defanging%20an%20IP%20Address.md) [easy]
[1110. Delete Nodes And Return Forest.md](./medium/1110.%20Delete%20Nodes%20And%20Return%20Forest.md) [medium]
[1114. Print in Order.md](./easy/1114.%20Print%20in%20Order.md) [easy]
[1122. Relative Sort Array.md](./easy/1122.%20Relative%20Sort%20Array.md) [easy]
[1123. Lowest Common Ancestor of Deepest Leaves.md](./medium/1123.%20Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves.md) [medium]
[1128. Number of Equivalent Domino Pairs.md](./easy/1128.%20Number%20of%20Equivalent%20Domino%20Pairs.md) [easy]
[1137. N-th Tribonacci Number.md](./easy/1137.%20N-th%20Tribonacci%20Number.md) [easy]
[1154. Day of the Year.md](./easy/1154.%20Day%20of%20the%20Year.md) [easy]
[1160. Find Words That Can Be Formed by Characters.md](./easy/1160.%20Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters.md) [easy]
[1170. Compare Strings by Frequency of the Smallest Character.md](./easy/1170.%20Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character.md) [easy]
[1171. Remove Zero Sum Consecutive Nodes from Linked List.md](./medium/1171.%20Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List.md) [medium]
[1175. Prime Arrangements.md](./easy/1175.%20Prime%20Arrangements.md) [easy]
[1179. Reformat Department Table.md](./easy/1179.%20Reformat%20Department%20Table.md) [easy]
[1184. Distance Between Bus Stops.md](./easy/1184.%20Distance%20Between%20Bus%20Stops.md) [easy]
[1185. Day of the Week.md](./easy/1185.%20Day%20of%20the%20Week.md) [easy]
[1189. Maximum Number of Balloons.md](./easy/1189.%20Maximum%20Number%20of%20Balloons.md) [easy]
[1200. Minimum Absolute Difference.md](./easy/1200.%20Minimum%20Absolute%20Difference.md) [easy]
[1207. Unique Number of Occurrences.md](./easy/1207.%20Unique%20Number%20of%20Occurrences.md) [easy]
[1217. Play with Chips.md](./easy/1217.%20Play%20with%20Chips.md) [easy]
[1221. Split a String in Balanced Strings.md](./easy/1221.%20Split%20a%20String%20in%20Balanced%20Strings.md) [easy]
[1232. Check If It Is a Straight Line.md](./easy/1232.%20Check%20If%20It%20Is%20a%20Straight%20Line.md) [easy]
[1237. Find Positive Integer Solution for a Given Equation.md](./easy/1237.%20Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation.md) [easy]
[1252. Cells with Odd Values in a Matrix.md](./easy/1252.%20Cells%20with%20Odd%20Values%20in%20a%20Matrix.md) [easy]
[1260. Shift 2D Grid.md](./easy/1260.%20Shift%202D%20Grid.md) [easy]
[1281. Subtract the Product and Sum of Digits of an Integer.md](./easy/1281.%20Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer.md) [easy]
[1290. Convert Binary Number in a Linked List to Integer.md](./easy/1290.%20Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer.md) [easy]
[1295. Find Numbers with Even Number of Digits.md](./easy/1295.%20Find%20Numbers%20with%20Even%20Number%20of%20Digits.md) [easy]
[1299. Replace Elements with Greatest Element on Right Side.md](./easy/1299.%20Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side.md) [easy]
[1302. Deepest Leaves Sum.md](./medium/1302.%20Deepest%20Leaves%20Sum.md) [medium]
[1304. Find N Unique Integers Sum up to Zero.md](./easy/1304.%20Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero.md) [easy]
[1305. All Elements in Two Binary Search Trees.md](./medium/1305.%20All%20Elements%20in%20Two%20Binary%20Search%20Trees.md) [medium]
[1315. Sum of Nodes with Even-Valued Grandparent.md](./medium/1315.%20Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent.md) [medium]
[1323. Maximum 69 Number.md](./easy/1323.%20Maximum%2069%20Number.md) [easy]
[1325. Delete Leaves With a Given Value.md](./medium/1325.%20Delete%20Leaves%20With%20a%20Given%20Value.md) [medium]
[1339. Maximum Product of Splitted Binary Tree.md](./medium/1339.%20Maximum%20Product%20of%20Splitted%20Binary%20Tree.md) [medium]
[1346. Check If N and Its Double Exist.md](./easy/1346.%20Check%20If%20N%20and%20Its%20Double%20Exist.md) [easy]
[1360. Number of Days Between Two Dates.md](./easy/1360.%20Number%20of%20Days%20Between%20Two%20Dates.md) [easy]
[1367. Linked List in Binary Tree.md](./medium/1367.%20Linked%20List%20in%20Binary%20Tree.md) [medium]
[1374. Generate a String With Characters That Have Odd Counts.md](./easy/1374.%20Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts.md) [easy]
[1375. Bulb Switcher III.md](./medium/1375.%20Bulb%20Switcher%20III.md) [medium]
[1376. Time Needed to Inform All Employees.md](./medium/1376.%20Time%20Needed%20to%20Inform%20All%20Employees.md) [medium]
[1380. Lucky Numbers in a Matrix.md](./easy/1380.%20Lucky%20Numbers%20in%20a%20Matrix.md) [easy]
[1422. Maximum Score After Splitting a String.md](./easy/1422.%20Maximum%20Score%20After%20Splitting%20a%20String.md) [easy]
[1436. Destination City.md](./easy/1436.%20Destination%20City.md) [easy]
[1437. Check If All 1's Are at Least Length K Places Away.md](./easy/1437.%20Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away.md) [easy]
[1450. Number of Students Doing Homework at a Given Time.md](./easy/1450.%20Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time.md) [easy]
[1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.md](./easy/1455.%20Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence.md) [easy]
[1460. Make Two Arrays Equal by Reversing Sub-arrays.md](./easy/1460.%20Make%20Two%20Arrays%20Equal%20by%20Reversing%20Sub-arrays.md) [easy]
[1464. Maximum Product of Two Elements in an Array.md](./easy/1464.%20Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array.md) [easy]
[1470. Shuffle the Array.md](./easy/1470.%20Shuffle%20the%20Array.md) [easy]
[1480. Running Sum of 1d Array.md](./easy/1480.%20Running%20Sum%20of%201d%20Array.md) [easy]
[1491. Average Salary Excluding the Minimum and Maximum Salary.md](./easy/1491.%20Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary.md) [easy]
[1669. Merge In Between Linked Lists.md](./medium/1669.%20Merge%20In%20Between%20Linked%20Lists.md) [medium]
[1721. Swapping Nodes in a Linked List.md](./medium/1721.%20Swapping%20Nodes%20in%20a%20Linked%20List.md) [medium]
[1859. Sorting the Sentence.md](./easy/1859.%20Sorting%20the%20Sentence.md) [easy]
[1869. Longer Contiguous Segments of Ones than Zeros.md](./easy/1869.%20Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros.md) [easy]
[1876. Substrings of Size Three with Distinct Characters.md](./easy/1876.%20Substrings%20of%20Size%20Three%20with%20Distinct%20Characters.md) [easy]
[1893. Check if All the Integers in a Range Are Covered.md](./easy/1893.%20Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered.md) [easy]
[1979. Find Greatest Common Divisor of Array.md](./easy/1979.%20Find%20Greatest%20Common%20Divisor%20of%20Array.md) [easy]
[1985. Find the Kth Largest Integer in the Array.md](./easy/1985.%20Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array.md) [easy]
[1991. Find the Middle Index in Array.md](./easy/1991.%20Find%20the%20Middle%20Index%20in%20Array.md) [easy]
[2000. Reverse Prefix of Word.md](./easy/2000.%20Reverse%20Prefix%20of%20Word.md) [easy]
[2085. Count Common Words With One Occurrence.md](./easy/2085.%20Count%20Common%20Words%20With%20One%20Occurrence.md) [easy]
[2089. Find Target Indices After Sorting Array.md](./easy/2089.%20Find%20Target%20Indices%20After%20Sorting%20Array.md) [easy]
[2185. Counting Words With a Given Prefix.md](./easy/2185.%20Counting%20Words%20With%20a%20Given%20Prefix.md) [easy]
[2190. Most Frequent Number Following Key In an Array.md](./easy/2190.%20Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array.md) [easy]
[2200. Find All K-Distant Indices in an Array.md](./easy/2200.%20Find%20All%20K-Distant%20Indices%20in%20an%20Array.md) [easy]
[2206. Divide Array Into Equal Pairs.md](./easy/2206.%20Divide%20Array%20Into%20Equal%20Pairs.md) [easy]
[2215. Find the Difference of Two Arrays.md](./easy/2215.%20Find%20the%20Difference%20of%20Two%20Arrays.md) [easy]
[2248. Intersection of Multiple Arrays.md](./easy/2248.%20Intersection%20of%20Multiple%20Arrays.md) [easy]
[2255. Count Prefixes of a Given String.md](./easy/2255.%20Count%20Prefixes%20of%20a%20Given%20String.md) [easy]
[2264. Largest 3-Same-Digit Number in String.md](./easy/2264.%20Largest%203-Same-Digit%20Number%20in%20String.md) [easy]
[2309. Greatest English Letter in Upper and Lower Case.md](./easy/2309.%20Greatest%20English%20Letter%20in%20Upper%20and%20Lower%20Case.md) [easy]
[2315. Count Asterisks.md](./easy/2315.%20Count%20Asterisks.md) [easy]
[2319. Check if Matrix Is X-Matrix.md](./easy/2319.%20Check%20if%20Matrix%20Is%20X-Matrix.md) [easy]
[2331. Evaluate Boolean Binary Tree.md](./easy/2331.%20Evaluate%20Boolean%20Binary%20Tree.md) [easy]
[2335. Minimum Amount of Time to Fill Cups.md](./easy/2335.%20Minimum%20Amount%20of%20Time%20to%20Fill%20Cups.md) [easy]
[2336. Smallest Number in Infinite Set.md](./medium/2336.%20Smallest%20Number%20in%20Infinite%20Set.md) [medium]
[2337. Move Pieces to Obtain a String.md](./medium/2337.%20Move%20Pieces%20to%20Obtain%20a%20String.md) [medium]
[2341. Maximum Number of Pairs in Array.md](./easy/2341.%20Maximum%20Number%20of%20Pairs%20in%20Array.md) [easy]
[2342. Max Sum of a Pair With Equal Sum of Digits.md](./medium/2342.%20Max%20Sum%20of%20a%20Pair%20With%20Equal%20Sum%20of%20Digits.md) [medium]
[2343. Query Kth Smallest Trimmed Number.md](./medium/2343.%20Query%20Kth%20Smallest%20Trimmed%20Number.md) [medium]
[2344. Minimum Deletions to Make Array Divisible.md](./hard/2344.%20Minimum%20Deletions%20to%20Make%20Array%20Divisible.md) [hard]
[2347. Best Poker Hand.md](./easy/2347.%20Best%20Poker%20Hand.md) [easy]
[2348. Number of Zero-Filled Subarrays.md](./medium/2348.%20Number%20of%20Zero-Filled%20Subarrays.md) [medium]
[2349. Design a Number Container System.md](./medium/2349.%20Design%20a%20Number%20Container%20System.md) [medium]
[2351. First Letter to Appear Twice.md](./easy/2351.%20First%20Letter%20to%20Appear%20Twice.md) [easy]
[2352. Equal Row and Column Pairs.md](./medium/2352.%20Equal%20Row%20and%20Column%20Pairs.md) [medium]
[2353. Design a Food Rating System.md](./medium/2353.%20Design%20a%20Food%20Rating%20System.md) [medium]
[2354. Number of Excellent Pairs.md](./hard/2354.%20Number%20of%20Excellent%20Pairs.md) [hard]
[2357. Make Array Zero by Subtracting Equal Amounts.md](./easy/2357.%20Make%20Array%20Zero%20by%20Subtracting%20Equal%20Amounts.md) [easy]
[2404. Most Frequent Even Element.md](./easy/2404.%20Most%20Frequent%20Even%20Element.md) [easy] ![](./img/new18.png)
[2405. Optimal Partition of String.md](./easy/2405.%20Optimal%20Partition%20of%20String.md) [easy] ![](./img/new18.png)