Id | Title | Difficulty | Tag |
---|---|---|---|
1 | Two Sum | E | HashTable | TwoPointer |
53 | Maximum Subarray | E | DP |
121 | Best Time to Buy and Sell Stock | E | DP |
11 | Container With Most Water | M | TwoPointer |
15 | 3Sum | M | Sort | TwoPinter |
31 | Next Permutation | M | Array | Greedy |
33 | Search in Rotated Sorted Array | M | BinarySearch |
54 | Spiral Matrix | M | Array |
56 | Merge Intervals | M | Sort | TreeMap |
42 | Trapping Rain Water | H | Stack | TwoPointers | Greedy |
Id | Title | Difficulty | Tag |
---|---|---|---|
21 | Merge Two Sorted Lists | E | LinkedList |
203 | Remove Linked List Elements | E | LinkedList |
206 | Reverse Linked List | E | LinkedList |
2 | Add Two Numbers | M | LinkedList |
86 | Partition List | M | LinkedList |
138 | Copy List with Random Pointer | M | LinkedList | Heap |
142 | Linked List Cycle II | M | LinkedList | TwoPointer |
148 | Sort List | M | Sort | LinkedList |
426 | Convert Binary Search Tree to Sorted Doubly Linked List | M | LinkedList | Tree | Stack |
25 | Reverse Nodes in k-Group | H | LinkedList |
Id | Title | Difficulty | Tag |
---|---|---|---|
107 | Binary Tree Level Order Traversal II | E | Tree | Recursion |
112 | Path Sum | E | Tree |
226 | Invert Binary Tree | E | Tree | BFS |
94 | Binary Tree Inorder Traversal | M | Tree | Stack |
95 | Unique Binary Search Trees II | M | DP | BST |
144 | Binary Tree Preorder Traversal | M | Tree | Stack |
236 | Lowest Common Ancestor of a Binary Tree | M | Tree |
124 | Binary Tree Maximum Path Sum | H | Tree |
145 | Binary Tree Postorder Traversal | H | Tree | Stack |
297 | Serialize and Deserialize Binary Tree | H | Tree | Recursion |
Id | Title | Difficulty | Tag |
---|---|---|---|
17 | Letter Combinations of a Phone Number | M | DFS |
22 | Generate Parentheses | M | DFS |
46 | Permutations | M | DFS |
51 | N-Queens | H | DFS |
78 | Subsets | M | DFS |
93 | Restore IP Addresses | M | DFS |
401 | Binary Watch | E | DFS |
687 | Longest Univalue Path | E | Tree | Recursion |
698 | Partition to K Equal Sum Subsets | M | DFS | DP | Bit Mask |
726 | Number of Atoms | H | Recursion |
Id | Title | Difficulty | Tag |
---|---|---|---|
101 | Symmetric Tree | E | Tree | Recursion | Stack |
104 | Maximum Depth of Binary Tree | E | Tree | Recursion |
108 | Convert Sorted Array to Binary Search Tree | E | Tree | Recursion | Stack | BFS |
105 | Construct Binary Tree from Preorder and Inorder Traversal | M | Tree | Recursion |
109 | Convert Sorted List to Binary Search Tree | M | Tree | Recursion | LinkedList |
114 | Flatten Binary Tree to Linked List | M | Tree | Recursion | Stack |
116 | Populating Next Right Pointers in Each Node | M | Tree | Recursion | BFS |
199 | Binary Tree Right Side View | M | Tree | Recursion |
394 | Decode String | M | Stack | DFS |
488 | Zuma Game | H | DFS |
Id | Title | Difficulty | Tag |
---|---|---|---|
70 | Climbing Stairs | E | DP |
198 | House Robber | E | DP |
303 | Range Sum Query - Immutable | E | DP |
5 | Longest Palindromic Substring | M | DP |
64 | Minimum Path Sum | M | DP |
139 | Word Break | M | DP | HashSet |
300 | Longest Increasing Subsequence | M | DP | Binary Search |
309 | Best Time to Buy and Sell Stock with Cooldown | M | DP |
322 | Coin Change | M | DP |
72 | Edit Distance | H | DP |
Id | Title | Difficulty | Tag |
---|---|---|---|
122 | Best Time to Buy and Sell Stock II | E | Greedy |
455 | Assign Cookies | E | Greedy |
55 | Jump Game | M | DP | Greedy |
134 | Gas Station | M | Greedy |
376 | Wiggle Subsequence | M | DP | Greedy |
406 | Queue Reconstruction by Height | M | Greedy |
621 | Task Scheduler | M | Greedy | PriorityQueue |
714 | Best Time to Buy and Sell Stock with Transaction Fee | M | DP | Greedy |
45 | Jump Game II | H | Greedy |
135 | Candy | H | Greedy |