Track
🧩 Coding Interview: Patterns & DSA
Big-O, two pointers, sliding window, prefix sums, hashing, fast/slow pointers, monotonic stacks, BFS/DFS, topological sort, union-find, backtracking, memoization and tabulation, binary search, and heaps. Learn to recognize the pattern behind a problem, reach for the right data structure, and state the complexity before you write a line — the way strong candidates actually pass.
Readiness0%
Lessons0/19
Cards mastered0/26
Focused study134 min
Roadmap
8 modules1
Big-O
2
Arrays
3
Hashing
4
Lists/Stacks
5
Trees/Graphs
6
DP
7
Search/Heaps
8
Execution
Modules
clear 60% to unlock the next📈MODULE 01
Complexity & Big-O
Time and space, amortized cost, and the complexities you must recognize on sight.
0%
🔤MODULE 02 · 🔒
Arrays & Strings
Two pointers, sliding window, and prefix sums — the three workhorse patterns.
🔒 clear more of the previous module
🗂MODULE 03 · 🔒
Hashing & Sets
Frequency maps and the 'seen' pattern — trading space for O(1) lookups.
🔒 clear more of the previous module
🔗MODULE 04 · 🔒
Linked Lists, Stacks & Queues
Fast/slow pointers, in-place reversal, and the monotonic stack.
🔒 clear more of the previous module
🌳MODULE 05 · 🔒
Trees & Graphs
Traversals, BFS vs DFS, topological sort, and union-find.
🔒 clear more of the previous module
🧮MODULE 06 · 🔒
Recursion, Backtracking & DP
From brute-force recursion to memoization and tabulation.
🔒 clear more of the previous module
🔎MODULE 07 · 🔒
Sorting, Searching & Heaps
Binary search patterns and the top-K / heap toolkit.
🔒 clear more of the previous module
🎙MODULE 08 · 🔒
Interview Execution
Clarify, plan, code, verify — the process interviewers actually grade.
🔒 clear more of the previous module