// Curriculum
Every pattern, visualised. Every problem, paired to a lesson. Follow the roadmap — skip nothing, regret nothing.
Master the building blocks every interview tests. These patterns appear in 80% of coding rounds.
Two pointers, sliding window, prefix sums, hash maps
Linked lists, trees, graphs, and heaps. The structures every senior engineer reasons about fluently.
Fast & slow pointers, reversal, cycle detection
BFS, DFS, BST, tries, segment trees
BFS, DFS, topological sort, union find
Kth largest, merge k sorted, task scheduling
DP, greedy, and backtracking — the hardest patterns that separate candidates at top companies.
Memoization, tabulation, classic DP patterns
Interval scheduling, jump game, gas station
Permutations, subsets, N-Queens, word search
Bit tricks, trie structures, and recursion patterns that round out your toolkit for FAANG-level interviews.
XOR tricks, counting bits, bit masking
Prefix trees, word search, autocomplete
Fibonacci, power functions, Pascal's triangle, mathematical recursion