Temas

Algoritmos

Big-O, estructuras de datos, divide y vencerás, DP y grafos — desde CLRS y Cracking the Coding Interview.

12lessons·425min total

Big-O Notation: Reading the Time Curve

Principiante·25 min

Arrays & Strings: The Two-Pointer Toolkit

Principiante·30 min

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

Intermedio·35 min

Linked Lists: Pointer Manipulation Patterns

Intermedio·30 min

Stacks & Queues: When LIFO/FIFO Saves Recursion

Principiante·25 min

Trees & BSTs: Structure-Driven Algorithms

Intermedio·40 min

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

Intermedio·45 min

Sorting: Comparison vs Linear Time

Intermedio·35 min

Binary Search: The Invariant Formula

Intermedio·30 min

Divide & Conquer + the Master Theorem

Avanzado·45 min

DP: Memoization, Tabulation, State Compression

Avanzado·50 min

Greedy Algorithms: Exchange Arguments

Avanzado·35 min