Learning Tracks
Your roadmap to real skills.
Many tracks and dozens of sub-tracks. Every track starts with a free intro lesson.
Learning Tracks
Many tracks and dozens of sub-tracks. Every track starts with a free intro lesson.
Big O to backtracking: the patterns interviews test.
~13 hours · 11 lessons
View track details →Big O Notation
Read and reason about complexity in Big O and analyze code for its time and space cost.
Binary Search
Implement binary search iteratively and recursively, and handle the leftmost/rightmost variations.
Sorting Algorithms
Compare bubble, insertion, merge, quick, heap, and non-comparison sorts and know which to use when.
Recursion
Write correct recursive functions and know when iteration is the better choice.
Dynamic Programming
Recognize DP problems and solve them top-down and bottom-up (coin change, LCS).
Greedy Algorithms
Apply the greedy choice property, and know when greedy works and when it fails.
Graph Algorithms
Apply BFS/DFS beyond traversal, implement Dijkstra, topological sort, and union-find.
String Algorithms
Apply sliding window and two-pointer patterns and understand substring search.
Backtracking
Apply the backtracking pattern to permutations, combinations, and constraint puzzles.
Passion Project: Algorithm Visualizer or Pattern Repo
Build a portfolio project applying the sub-track's algorithms: an interactive visualizer or a documented pattern-solutions repo.
Technical Interview Job Readiness
Understand LeetCode-style interviews, approach problems out loud, manage time, and recognize recurring patterns.