Name	Name	Last commit message	Last commit date
Latest commit History 285 Commits
1-two-sum	1-two-sum
100. Same Tree	100. Same Tree
1005-maximize-sum-of-array-after-k-negations	1005-maximize-sum-of-array-after-k-negations
102. Binary Tree Level Order Traversal	102. Binary Tree Level Order Traversal
104. Maximum Depth of Binary Tree	104. Maximum Depth of Binary Tree
1046. Last Stone Weight	1046. Last Stone Weight
105. Construct Binary Tree from Preorder and Inorder Traversal	105. Construct Binary Tree from Preorder and Inorder Traversal
11. Container With Most Water	11. Container With Most Water
110. Balanced Binary Tree	110. Balanced Binary Tree
1108-defanging-an-ip-address	1108-defanging-an-ip-address
1154-day-of-the-year	1154-day-of-the-year
121. Best Time to Buy and Sell Stock	121. Best Time to Buy and Sell Stock
124. Binary Tree Maximum Path Sum	124. Binary Tree Maximum Path Sum
125. Valid Palindrome	125. Valid Palindrome
1305-all-elements-in-two-binary-search-trees	1305-all-elements-in-two-binary-search-trees
131. Palindrome Partitioning	131. Palindrome Partitioning
1329-sort-the-matrix-diagonally	1329-sort-the-matrix-diagonally
133. Clone Graph	133. Clone Graph
1346-check-if-n-and-its-double-exist	1346-check-if-n-and-its-double-exist
1365-how-many-numbers-are-smaller-than-the-current-number	1365-how-many-numbers-are-smaller-than-the-current-number
138. Copy List with Random Pointer	138. Copy List with Random Pointer
141. Linked List Cycle	141. Linked List Cycle
1418-display-table-of-food-orders-in-a-restaurant	1418-display-table-of-food-orders-in-a-restaurant
143. Reorder List	143. Reorder List
1448. Count Good Nodes in Binary Tree	1448. Count Good Nodes in Binary Tree
146. LRU Cache	146. LRU Cache
1464-maximum-product-of-two-elements-in-an-array	1464-maximum-product-of-two-elements-in-an-array
1476-subrectangle-queries	1476-subrectangle-queries
15. 3Sum	15. 3Sum
150. Evaluate Reverse Polish Notation	150. Evaluate Reverse Polish Notation
153. Find Minimum in Rotated Sorted Array	153. Find Minimum in Rotated Sorted Array
155. Min Stack	155. Min Stack
1561-maximum-number-of-coins-you-can-get	1561-maximum-number-of-coins-you-can-get
1630-arithmetic-subarrays	1630-arithmetic-subarrays
1637-widest-vertical-area-between-two-points-containing-no-points	1637-widest-vertical-area-between-two-points-containing-no-points
167. Two Sum II - Input Array Is Sorted	167. Two Sum II - Input Array Is Sorted
1685. Sum of Absolute Differences in a Sorted Array	1685. Sum of Absolute Differences in a Sorted Array
17. Letter Combinations of a Phone Number	17. Letter Combinations of a Phone Number
1727. Largest Submatrix With Rearrangements	1727. Largest Submatrix With Rearrangements
1828-queries-on-number-of-points-inside-a-circle	1828-queries-on-number-of-points-inside-a-circle
1859-sorting-the-sentence	1859-sorting-the-sentence
1877-minimize-maximum-pair-sum-in-array	1877-minimize-maximum-pair-sum-in-array
19. Remove Nth Node From End of List	19. Remove Nth Node From End of List
1913-maximum-product-difference-between-two-pairs	1913-maximum-product-difference-between-two-pairs
199. Binary Tree Right Side View	199. Binary Tree Right Side View
2-add-two-numbers	2-add-two-numbers
20. Valid Parentheses	20. Valid Parentheses
200. Number of Islands	200. Number of Islands
2037-minimum-number-of-moves-to-seat-everyone	2037-minimum-number-of-moves-to-seat-everyone
206. Reverse Linked List	206. Reverse Linked List
208. Implement Trie (Prefix Tree)	208. Implement Trie (Prefix Tree)
2089-find-target-indices-after-sorting-array	2089-find-target-indices-after-sorting-array
2099-find-subsequence-of-length-k-with-the-largest-sum	2099-find-subsequence-of-length-k-with-the-largest-sum
21. Merge Two Sorted Lists	21. Merge Two Sorted Lists
211. Design Add and Search Words Data Structure	211. Design Add and Search Words Data Structure
212. Word Search II	212. Word Search II
215. Kth Largest Element in an Array	215. Kth Largest Element in an Array
216. Combination Sum III	216. Combination Sum III
2160-minimum-sum-of-four-digit-number-after-splitting-digits	2160-minimum-sum-of-four-digit-number-after-splitting-digits
22. Generate Parentheses	22. Generate Parentheses
226. Invert Binary Tree	226. Invert Binary Tree
2294-partition-array-such-that-maximum-difference-is-k	2294-partition-array-such-that-maximum-difference-is-k
23. Merge k Sorted Lists	23. Merge k Sorted Lists
230. Kth Smallest Element in a BST	230. Kth Smallest Element in a BST
235. Lowest Common Ancestor of a Binary Search Tree	235. Lowest Common Ancestor of a Binary Search Tree
2365. Task Scheduler II	2365. Task Scheduler II
238. Product of Array Except Self	238. Product of Array Except Self
239. Sliding Window Maximum	239. Sliding Window Maximum
2418-sort-the-people	2418-sort-the-people
25. Reverse Nodes in k-Group	25. Reverse Nodes in k-Group
271. Encode and Decode Strings	271. Encode and Decode Strings
286. Walls and Gates	286. Walls and Gates
287. Find the Duplicate Number	287. Find the Duplicate Number
295. Find Median from Data Stream	295. Find Median from Data Stream
297. Serialize and Deserialize Binary Tree	297. Serialize and Deserialize Binary Tree
3. Longest Substring Without Repeating Characters	3. Longest Substring Without Repeating Characters
31. Next Permutation	31. Next Permutation
33. Search in Rotated Sorted Array	33. Search in Rotated Sorted Array
344-reverse-string	344-reverse-string
347. Top K Frequent Elements	347. Top K Frequent Elements
355. Design Twitter	355. Design Twitter
36. Valid Sudoku	36. Valid Sudoku
39. Combination Sum	39. Combination Sum
4. Median of Two Sorted Arrays	4. Median of Two Sorted Arrays
40. Combination Sum II	40. Combination Sum II
406-queue-reconstruction-by-height	406-queue-reconstruction-by-height
414-third-maximum-number	414-third-maximum-number
42. Trapping Rain Water	42. Trapping Rain Water
424. Longest Repeating Character Replacement	424. Longest Repeating Character Replacement
438. Find All Anagrams in a String	438. Find All Anagrams in a String
455-assign-cookies	455-assign-cookies
46. Permutations	46. Permutations
47. Permutations II	47. Permutations II
51. N-Queens	51. N-Queens
52. N-Queens II	52. N-Queens II
541-reverse-string-ii	541-reverse-string-ii
543. Diameter of Binary Tree	543. Diameter of Binary Tree
561-array-partition	561-array-partition
567. Permutation in String	567. Permutation in String
572. Subtree of Another Tree	572. Subtree of Another Tree

Name

Last commit message

Last commit date

285 Commits

1-two-sum

100. Same Tree

1005-maximize-sum-of-array-after-k-negations

102. Binary Tree Level Order Traversal

104. Maximum Depth of Binary Tree

1046. Last Stone Weight

105. Construct Binary Tree from Preorder and Inorder Traversal

11. Container With Most Water