ID | Problem | Difficulty | Tags |
---|---|---|---|
1 | Two Sum | Easy | K-Sum, Hash Table |
15 | 3Sum | Medium | Sort, Bi-directional Search |
289 | Game of Life | Medium | Trick |
84 | Largest Rectangle in Histogram | Hard | Monotonic Stack |
239 | Sliding Window Maximum | Hard | Monotonic Queue |
300 | Longest Increasing Subsequence | Medium | DP, Binary Search |
1713 | Minimal Operations to Make a Subsequence | Hard | DP, Binary Search |
23 | Merge k Sorted Lists | Hard | Heap, Divide and Conquer |
ID | Problem | Difficulty | Tags |
---|---|---|---|
763 | Partition Labels | Medium | Hash Table |
10 | Regular Expression Matching | Hard | DP |
32 | Longest Valid Parentheses | Hard | Stack, DP |
5 | Longest Palindromic Substring | Medium | DP |
ID | Problem | Difficulty | Tags |
---|---|---|---|
617 | Merge Two Binary Trees | Medium | Divide and Conquer |
104 | Maximum Depth of Binary Tree | Easy | Divide and Conquer |
1457 | Pseudo-Palindromic Paths in a Binary Tree | Medium | BFS/DFS, Bit Manipulation |
98 | Validate Binary Search Tree | Medium | Recursion, DFS |
ID | Problem | Difficulty | Tags |
---|---|---|---|
399 | Evaluate Division | Medium | Union-Find, Recursion |
ID | Problem | Difficulty | Tags |
---|---|---|---|
338 | Counting Bits | Medium | DP |
ID | Problem | Difficulty | Tags |
---|---|---|---|
406 | Queue Reconstruction by Height | Medium | Sort |
330 | Patching Array | Hard | Greedy, Math |
ID | Problem | Difficulty | Tags |
---|---|---|---|
754 | Reach a Number | Medium | Math |
ID | Problem | Difficulty | Tags |
---|---|---|---|
435 | Non-overlapping Intervals | Medium | Greedy, Sort |