Practice by Category
Problems organized by data structure and algorithm pattern β sorted by problem count
Strings
81Pattern matching, palindromes, substrings
Trees
76BST, DFS, BFS, traversals, tree construction
Arrays
72Two pointers, sliding window, binary search, sorting
Dynamic Programming
43Knapsack, LIS, LCS, coin change, grid DP
Math
37Number theory, geometry, combinatorics
SQL
29Joins, aggregations, window functions
Linked Lists
29Reversal, merge, cycle detection, two pointers
Sorting
27Merge sort, quick sort, counting sort, custom
Graphs
22BFS, DFS, topological sort, shortest path
Matrix
19Grid traversal, rotation, spiral, search
Backtracking
18Permutations, combinations, N-Queens, Sudoku
Bit Manipulation
17XOR tricks, bit masks, power of two
Greedy
16Interval scheduling, activity selection, optimal
Design
12LRU Cache, Iterator, data structure design
Stack
10Monotonic stack, expression parsing, next greater
Trie
3Prefix matching, autocomplete, word search
Heap
3Priority queue, top-K, merge K sorted
Shell & Misc
2Bash one-liners β word frequency, regex validation
Why This Works
Pattern-Based Learning
Problems organized by algorithm patterns so you learn the technique, not just memorize solutions. Recognize patterns across problems.
Visual Explanations
Mermaid diagrams for trees, graphs, and DP state transitions. See how algorithms work step by step.
Multiple Approaches
From brute force to optimal β with time/space complexity analysis for each approach so you understand tradeoffs.
Interview-Ready
Key insights, edge cases, and follow-up questions that interviewers commonly ask. Be prepared for any curveball.
Well-Organized & Fast
Sorted sidebar, category pages, and quick navigation. Find any problem or pattern by category or name instantly.
Structured Study Plan
Follow an 8-week roadmap from fundamentals to advanced topics. Know exactly what to study and when.
Ready to Start?
Follow the structured study guide or dive into any category. Every problem has solutions, explanations, and complexity analysis.