README.md
1. Two Sum
2. Add Two Numbers
3. Longest Substring Without Repeating Characters
5. Longest Palindromic Substring
6. ZigZag Conversion
7. Reverse Integer
9. Palindrome Number
10. Regular Expression Matching
11. Container With Most Water
14. Longest Common Prefix
15. 3Sum
16.3Sum Closest
17. Letter Combinations of a Phone Number
18. 4Sum
19. Remove Nth Node From End of List
20. Valid Parentheses
21. Merge Two Sorted Lists
22. Generate Parentheses
23. Merge k Sorted Lists
24. Swap Nodes in Pairs
27. Remove Element
28. Implement strStr()
29. Divide Two Integers
31. Next Permutation
32. Longest Valid Parentheses
33. Search in Rotated Sorted Array
34. Find First and Last Position of Element in Sorted Array
35. Search Insert Position
36. Valid Sudoku
39. Combination Sum
40. Combination Sum II
41. First Missing Positive
42. Trapping Rain Water
44. Wildcard Matching
45. Jump Game II
46. Permutations
47. Permutations II
48. Rotate Image
49. Group Anagrams
50. Pow(x, n)
51. N-Queens
52. N-Queens II
53. Maximum Subarray
54. Spiral Matrix
55. Jump Game
56. Merge Intervals
57. Insert Interval
59. Spiral Matrix II
60. Permutation Sequence
61. Rotate List
62. Unique Paths
63. Unique Paths II
64. Minimum Path Sum
67. Add Binary
69. Sqrt(x)
70. Climbing Stairs
72. Edit Distance
73. Set Matrix Zeroes
74. Search a 2D Matrix
75. Sort Colors
76. Minimum Window Substring
77. Combinations
78. Subsets
79. Word Search
80. Remove Duplicates from Sorted Array II
81. Search in Rotated Sorted Array II
82. Remove Duplicates from Sorted List II
83. Remove Duplicates from Sorted List
84. Largest Rectangle in Histogram
85. Maximal Rectangle
86. Partition List
87. Scramble String
88. Merge Sorted Array
90. Subsets II
91. Decode Ways
92. Reverse Linked List II
93. Restore IP Addresses
94. Binary Tree Inorder Traversal
95. Unique Binary Search Trees II
96. Unique Binary Search Trees
97. Interleaving String
98. Validate Binary Search Tree
99. Recover Binary Search Tree
100. Same Tree
101. Symmetric Tree
102. Binary Tree Level Order Traversal
103. Binary Tree Zigzag Level Order Traversal
104. Maximum Depth of Binary Tree
105. Construct Binary Tree from Preorder and Inorder Traversal
106. Construct Binary Tree from Inorder and Postorder Traversal
107. Binary Tree Level Order Traversal II
108. Convert Sorted Array to Binary Search Tree
110. Balanced Binary Tree
111. Minimum Depth of Binary Tree
112. Path Sum
113. Path Sum II
114. Flatten Binary Tree to Linked List
115. Distinct Subsequences.md
118. Pascal's Triangle
120. Triangle
121. Best Time to Buy and Sell Stock
122. Best Time to Buy and Sell Stock II
123. Best Time to Buy and Sell Stock III
124. Binary Tree Maximum Path Sum
127. Word Ladder
128. Longest Consecutive Sequence
129. Sum Root to Leaf Numbers
130. Surrounded Regions
131. Palindrome Partitioning
132. Palindrome Partitioning II
133. Clone Graph
134. Gas Station
135. Candy
136. Single Number
137. Single Number II
139. Word Break
140. Word Break II
141. Linked List Cycle
142. Linked List Cycle II
143. Reorder List
144. Binary Tree Preorder Traversal
145. Binary Tree Postorder Traversal
147. Insertion Sort List
148. Sort List
150. Evaluate Reverse Polish Notation
151. Reverse Words in a String
152. Maximum Product Subarray
153. Find Minimum in Rotated Sorted Array
154. Find Minimum in Rotated Sorted Array II
155. Min Stack
160. Intersection of Two Linked Lists
164. Maximum Gap
169. Majority Element
179. Largest Number
187. Repeated DNA Sequences
188. Best Time to Buy and Sell Stock IV
199. Binary Tree Right Side View
200. Number of Islands
201. Bitwise AND of Numbers Range
202. Happy Number
204. Count Primes
205. Isomorphic Strings
207. Course Schedule
[208. Implement Trie (Prefix Tree)](208.-Implement-Trie-(Prefix-Tree).md)
209. Minimum Size Subarray Sum
211. Add and Search Word Data structure design
212. Word Search II
214. Shortest Palindrome
216. Combination Sum III
217. Contains Duplicate
219. Contains Duplicate II
220. Contains Duplicate III
221. Maximal Square
222. Count Complete Tree Nodes
223. Rectangle Area
224. Basic Calculator
225. Implement Stack using Queues
226. Invert Binary Tree
229. Majority Element II
230. Kth Smallest Element in a BST
231. Power of Two
232. Implement Queue using Stacks
234. Palindrome Linked List
235. Lowest Common Ancestor of a Binary Search Tree
236. Lowest Common Ancestor of a Binary Tree
238. Product of Array Except Self
239. Sliding Window Maximum
240. Search a 2D Matrix II
241. Different Ways to Add Parentheses
257. Binary Tree Paths
260. Single Number III
264. Ugly Number II
268. Missing Number
279. Perfect Squares
282. Expression Add Operators
287. Find the Duplicate Number
654. Maximum Binary Tree
657. Robot Return to Origin
659. Split Array into Consecutive Subsequences
662. Maximum Width of Binary Tree
1223. Dice Roll Simulation

Powered by GitBook

On this page

[208. Implement Trie (Prefix Tree)](208.-Implement-Trie-(Prefix-Tree).md)

Previous207. Course Schedule Next209. Minimum Size Subarray Sum

Last updated 4 years ago