Topics

Algorithms

Big-O, data structures, divide & conquer, DP, graphs — sourced from CLRS and Cracking the Coding Interview.

12lessons·425min total

Big-O Notation: Reading the Time Curve

Beginner·25 min

Arrays & Strings: The Two-Pointer Toolkit

Beginner·30 min

Hash Tables: Why O(1) Isn't Free

Intermediate·35 min

Linked Lists: Pointer Manipulation Patterns

Intermediate·30 min

Stacks & Queues: When LIFO/FIFO Saves Recursion

Beginner·25 min

Trees & BSTs: Structure-Driven Algorithms

Intermediate·40 min

Graphs: BFS, DFS, and the Shape of the Frontier

Intermediate·45 min

Sorting: Comparison vs Linear Time

Intermediate·35 min

Binary Search: The Invariant Formula

Intermediate·30 min

Divide & Conquer + the Master Theorem

Advanced·45 min

DP: Memoization, Tabulation, State Compression

Advanced·50 min

Greedy Algorithms: Exchange Arguments

Advanced·35 min