Problem Bank
Practice algorithmic challenges and build rating.
| # | Problem | Difficulty | Tags | Rating | Solved | Acceptance | Action |
|---|---|---|---|---|---|---|---|
| 001 | Two Sum | Easy | arrays, hash-table | 800 | 14.2K | 78% | |
| 002 | Valid Parentheses | Easy | stack, strings | 900 | 11.8K | 82% | |
| 003 | Longest Substring | Medium | strings, sliding-window | 1200 | 8.4K | 64% | |
| 004 | Binary Search | Medium | binary-search, arrays | 1100 | 7.6K | 71% | |
| 005 | Merge Sorted Lists | Medium | linked-list, pointers | 1300 | 6.9K | 68% | |
| 006 | Lowest Common Ancestor | Hard | trees, recursion | 1600 | 3.8K | 44% | |
| 007 | Dijkstra's Algorithm | Hard | graphs, shortest-path | 1800 | 3.1K | 39% | |
| 008 | Minimum Spanning Tree | Hard | graphs, greedy | 1750 | 2.7K | 35% |