DSA by Patterns
Learn the patterns. Nail the loop.
Pattern-first problem lists across 10 topics—260+ curated questions with LeetCode links and company tags, aligned with how coding interviews are run today.
Free topic lists · LeetCode links · Company tags
Who it's for
Coding interviews, new grad to senior
One pattern-first map—start with arrays and strings for early loops, or jump to trees, graphs, and DP for the depth senior panels run.
- New grad software engineer
- Backend engineer
- Full-stack engineer
- SDE II / senior SWE
- FAANG & big tech prep
- Coding interview loops
Three pillars
What you'll master
Core patterns first—then trees, graphs, and DP, plus curated problem lists with the tags and links you need under time pressure.
Core pattern fluency
Arrays, strings, and search—the building blocks every loop opens with
- Two pointer, sliding window & prefix sums
- Hashing, greedy tricks & in-place transforms
- Binary search on arrays and answer spaces
- Stack, queue & linked list fundamentals
Tree, graph & DP depth
The patterns mid-level and senior panels expect you to recognize fast
- DFS/BFS on trees and graphs
- Dynamic programming families & recurrence
- Greedy intervals, heaps & priority queues
- Shortest path, topo sort & union find
Interview-ready outcomes
Curated lists that mirror real company loops—not random LeetCode grinding
- Pattern-labeled problems with summaries
- LeetCode links and company tags
- Topic-wise lists you can drill in order
- 260+ problems mapped to interview patterns
Every topic covered
10 DSA topics with the patterns covered in each problem list.
| # | Topic | Patterns |
|---|---|---|
| 1 | Array | Two Pointer, Sliding Window, Prefix Sum, Kadane’s Algorithm, Greedy/Hashing, Matrix, Monotonic Stack, In-place Transformations |
| 2 | String | Sliding Window, Hashing, Two Pointer, Trie / Prefix Tree |
| 3 | Binary search | Classic Binary Search, Binary Search on Answer, Rotated Sorted Array, Finding Boundaries |
| 4 | Linked list | Fast & Slow Pointer, Reversal, Merge Two Lists, Cycle Detection |
| 5 | Stack & queue | Balanced Parentheses, Next Greater Element, Stack as Recursion Simulator, Histogram / Largest Rectangle, Sliding Window, Circular Queue / Ring Buffer, First Unique Character |
| 6 | Binary tree | DFS / BFS, Lowest Common Ancestor, Balanced Tree Check, Binary Search Tree, Tree Diameter |
| 7 | Dynamic programming | Knapsack, Longest Common Subsequence, Coin Change, Fibonacci / Recurrence, Subset Sum, DP on Trees |
| 8 | Graph | DFS / BFS, Cycle Detection, Topological Sort, Shortest Path, Union Find / Disjoint Set |
| 9 | Greedy | Activity Selection, Huffman Coding, Job Scheduling, Interval Merging |
| 10 | Heap | Min/Max Heap, Kth Largest/Smallest, Merge K Sorted Lists, Sliding Window Max |
Practice machine coding
After the lists—rehearse JavaScript and React challenges in the live editor with automated tests.
Machine coding practice
Real interview-style problems in the browser—write code, run tests, and mark challenges solved on your profile.
- JS & React machine coding challenges
- In-editor tests and starter templates
- Profile dashboard for solved progress