Category

🧮 Algorithms & Coding Interviews

Patterns for coding interviews: two pointers, sliding window, trees, graphs, DP, with every solution in TypeScript and Python.

Foundations

01The Coding Interview Method 02Big-O for Interviews

Arrays, Strings & Linear Structures

01Arrays & Hashing 02Two Pointers 03Sliding Window 04Prefix Sums 05Binary Search 06Stacks & Monotonic Stack 07Queues & Deques 08Linked Lists 09Intervals

Recursion & Trees

01Recursion & Backtracking 02Tree Traversals 03Binary Search Trees 04Heaps & Top-K 05Tries

Graphs

01Graph BFS, DFS & Grids 02Topological Sort 03Union-Find 04Shortest Paths

Greedy, DP & Bits

01Greedy 02Dynamic Programming Fundamentals 03DP on Grids & Knapsack 04DP on Strings 05Bit Manipulation 06Math & Matrix

Practice Plan

01Problem Roadmap & Study Plan