Foundations
The essentials, in an order you can follow from zero.
Your progress on Foundations
89 stopsin taught order
The path
Array4 stops
- Array: Insert 7 at index 2Data Structures
This stop teaches: ArrayArray Insert
- Array: Delete index 1Array Algorithms and Techniques
This stop teaches: Array Delete
- Array: Visit every slotArray Algorithms and Techniques
This stop teaches: Array Traversal
- Array: Linear search, foundSearching
This stop teaches: Linear Search
- Array: Insert 7 at index 2Data Structures
Binary Search1 stop
- Binary SearchSearching
This stop teaches: Binary Search
- Binary SearchSearching
Two Pointers3 stops
- Two Pointers: Two sum on a sorted arrayArray Algorithms and Techniques
This stop teaches: Two Pointer TraversalTwo PointersOpposite Direction PointersTwo Sum (sorted)
- Two Pointers: Remove duplicatesTwo Pointers
This stop teaches: Same Direction PointersRemove Duplicates from Sorted Array
- Two Pointers: Reverse in placeArray Algorithms and Techniques
This stop teaches: Reverse Array
- Two Pointers: Two sum on a sorted arrayArray Algorithms and Techniques
Bubble Sort1 stop
- Bubble SortSorting
This stop teaches: Bubble Sort
- Bubble SortSorting
Insertion Sort1 stop
- Insertion SortSorting
This stop teaches: Insertion Sort
- Insertion SortSorting
Selection Sort1 stop
- Selection SortSorting
This stop teaches: Selection Sort
- Selection SortSorting
Dynamic Array1 stop
- Dynamic ArrayData Structures
This stop teaches: Dynamic Array
- Dynamic ArrayData Structures
Singly Linked List6 stops
- Singly Linked List: Reverse the listData Structures
This stop teaches: Singly Linked ListReverse Linked List
- Singly Linked List: Insert at the headLinked List Algorithms
This stop teaches: Insert at Head
- Singly Linked List: Insert at index 2Linked List Algorithms
This stop teaches: Insert at Position
- Singly Linked List: TraverseLinked List Algorithms
This stop teaches: Traversal
- Singly Linked List: Delete 4Linked List Algorithms
This stop teaches: Delete Node
- Singly Linked List: Insert at the tailLinked List Algorithms
This stop teaches: Insert at Tail
- Singly Linked List: Reverse the listData Structures
Bit Manipulation5 stops
- Bit Manipulation: Read one bitBit Manipulation
This stop teaches: Get Bit
- Bit Manipulation: Clear a bit that was 1Bit Manipulation
This stop teaches: Clear Bit
- Bit Manipulation: Count the 1s, Kernighan styleBit Manipulation
This stop teaches: Count Set Bits
- Bit Manipulation: Set a bit that was 0Bit Manipulation
This stop teaches: Set Bit
- Bit Manipulation: Flip a bitBit Manipulation
This stop teaches: Toggle Bit
- Bit Manipulation: Read one bitBit Manipulation
Number Theory Basics3 stops
Sieve of Eratosthenes1 stop
- Sieve of Eratosthenes: Primes up to 30Mathematics
This stop teaches: Sieve of Eratosthenes
- Sieve of Eratosthenes: Primes up to 30Mathematics
Complexity in Numbers2 stops
Best, Average, Worst1 stop
Brute Force1 stop
- Brute Force: Found near the endAlgorithmic Paradigms
This stop teaches: Brute Force
- Brute Force: Found near the endAlgorithmic Paradigms
Merging Sorted Lists1 stop
Queue1 stop
Stack1 stop
The Call Stack3 stops
- The Call Stack: fact(5) down and back upData Structures
This stop teaches: Call Stack
- The Call Stack: Summing a list recursivelyRecursion
This stop teaches: Recursion
- The Call Stack: No base case, stack overflowRecursion
This stop teaches: Base Case and Recursive Case
- The Call Stack: fact(5) down and back upData Structures
Tree Traversals4 stops
- Tree Traversals: Inorder comes out sortedData Structures
This stop teaches: Binary TreeInorder Traversal
- Tree Traversals: Level order uses a queueTree Algorithms
This stop teaches: Level Order Traversal
- Tree Traversals: Postorder, root comes lastTree Algorithms
This stop teaches: Postorder Traversal
- Tree Traversals: Preorder, node before subtreesTree Algorithms
This stop teaches: Preorder Traversal
- Tree Traversals: Inorder comes out sortedData Structures
BFS and DFS3 stops
- BFS and DFS: Breadth-first from 0Data Structures
This stop teaches: GraphAdjacency ListBreadth-First Search
- BFS and DFS: Depth-first from 0Graph Traversal
This stop teaches: Depth-First Search
- BFS and DFS: Three componentsGraph Traversal
This stop teaches: Connected Components
- BFS and DFS: Breadth-first from 0Data Structures
DFS Checks1 stop
- DFS Checks: Recursive DFS and its call stackGraph Traversal
This stop teaches: DFS Recursive
- DFS Checks: Recursive DFS and its call stackGraph Traversal
Shortest Paths2 stops
- Shortest Paths: Dijkstra on directed edgesData Structures
This stop teaches: Directed Graph
- Shortest Paths: Dijkstra from 0Data Structures
This stop teaches: Weighted GraphDijkstra
- Shortest Paths: Dijkstra on directed edgesData Structures
Binary Search Tree2 stops
- Binary Search Tree: Search for 45Data Structures
This stop teaches: Binary Search TreeBST Search
- Binary Search Tree: Insert 65Tree Algorithms
This stop teaches: BST Insert
- Binary Search Tree: Search for 45Data Structures
BST Queries1 stop
- BST Queries: Find the minimumTree Algorithms
This stop teaches: Find Minimum and Maximum
- BST Queries: Find the minimumTree Algorithms
DP on a Grid1 stop
String Matching1 stop
Stacks for Expressions1 stop
Matrix2 stops
- Matrix: Row-major orderData Structures
This stop teaches: Matrix
- Matrix: Adjacency matrix from edgesData Structures
This stop teaches: Adjacency Matrix
- Matrix: Row-major orderData Structures
Flood Fill1 stop
- Flood Fill: Fill a regionGraph Traversal
This stop teaches: Flood Fill
- Flood Fill: Fill a regionGraph Traversal
Prefix Sum and Kadane2 stops
Knapsack1 stop
- Knapsack: 0/1 knapsack, capacity 7Dynamic Programming
This stop teaches: 0/1 Knapsack
- Knapsack: 0/1 knapsack, capacity 7Dynamic Programming
String DP2 stops
- String DP: LCS of abcde and aceDynamic Programming
This stop teaches: Longest Common Subsequence
- String DP: kitten to sittingDynamic Programming
This stop teaches: Edit Distance
- String DP: LCS of abcde and aceDynamic Programming
BST QueriesAgain, 1 stop
Binary Search TreeAgain, 1 stop
Binary Heap4 stops
- Binary Heap: Build a min heapData Structures
This stop teaches: Binary HeapMin HeapHeapify (Build Heap)
- Binary Heap: Build a max heapData Structures
This stop teaches: Max Heap
- Binary Heap: Insert climbs to the rootData Structures
This stop teaches: Priority QueueSift UpHeap Insert
- Binary Heap: Extract the minimumHeap Algorithms
This stop teaches: Sift DownExtract Min / Max
- Binary Heap: Build a min heapData Structures
Backtracking1 stop
- Backtracking: 4 queens, with backtrackingBacktracking
This stop teaches: BacktrackingN-Queens
- Backtracking: 4 queens, with backtrackingBacktracking
Greedy Choice1 stop
- Greedy Choice: Coins where greedy failsAlgorithmic Paradigms
This stop teaches: Greedy
- Greedy Choice: Coins where greedy failsAlgorithmic Paradigms
Hash Table3 stops
Hash Map1 stop
- Hash Map: Filling buckets, with collisionsData Structures
This stop teaches: Hash Map
- Hash Map: Filling buckets, with collisionsData Structures
Frequency Map1 stop
Enumeration2 stops
- Enumeration: All orderings of threeBacktracking
This stop teaches: Permutations
- Enumeration: All subsets of threeBacktracking
This stop teaches: Subsets
- Enumeration: All orderings of threeBacktracking
Recursion Trees3 stops
- Recursion Trees: Divide and conquer over a rangeDivide and Conquer
This stop teaches: Divide and Conquer
- Recursion Trees: fib(5), the plain treeDynamic Programming
This stop teaches: Overlapping Subproblems
- Recursion Trees: fib(6) with memoizationDynamic Programming
This stop teaches: MemoizationDynamic Programming
- Recursion Trees: Divide and conquer over a rangeDivide and Conquer
DP in One Row3 stops
- DP in One Row: Fibonacci by tableDynamic Programming
This stop teaches: Fibonacci
- DP in One Row: Ways to climb 8 stairsDynamic Programming
This stop teaches: Climbing Stairs
- DP in One Row: Fewest coins for 6 from 1, 3, 4Dynamic Programming
This stop teaches: Coin Change
- DP in One Row: Fibonacci by tableDynamic Programming
Merge Sort1 stop
- Merge Sort: Eight valuesSorting
This stop teaches: Merge Sort
- Merge Sort: Eight valuesSorting
Number Theory BasicsAgain, 1 stop
- Number Theory Basics: 3 to the 13, mod 7Mathematics
This stop teaches: Fast Exponentiation
- Number Theory Basics: 3 to the 13, mod 7Mathematics
Fast and Slow Pointers2 stops
Quick Sort1 stop
- Quick Sort: Seven valuesArray Algorithms and Techniques
This stop teaches: PartitionQuick Sort
- Quick Sort: Seven valuesArray Algorithms and Techniques
Sliding Window2 stops
Not this one?
Interview Core covers the same curriculum with a different reach, and every topic is reachable on its own, grouped by category.