Interview Core
The mainstream set a university course or an interview loop expects, easiest first.
Your progress on Interview Core
180 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
Stable Sorting1 stop
- Stable Sorting: Selection sort flips itComplexity Analysis
This stop teaches: Stable Sorting
- Stable Sorting: Selection sort flips itComplexity Analysis
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
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
LRU Cache1 stop
Queue1 stop
Circular Queue1 stop
- Circular Queue: Rear wraps aroundData Structures
This stop teaches: Circular Queue
- Circular Queue: Rear wraps aroundData Structures
Deque1 stop
- Deque: Push and pop at both endsData Structures
This stop teaches: Deque
- Deque: Push and pop at both endsData Structures
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 SearchDFS Iterative
- 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
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
Stacks for Expressions1 stop
String Matching1 stop
Stacks for ExpressionsAgain, 1 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 Kadane1 stop
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 BitsBrian Kernighan's Algorithm
- 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
XOR Tricks1 stop
- XOR Tricks: Swap without a temporaryBit Manipulation
This stop teaches: XOR Properties
- XOR Tricks: Swap without a temporaryBit Manipulation
Number Theory Basics4 stops
- Number Theory Basics: gcd(48, 18) by EuclidMathematics
This stop teaches: Greatest Common DivisorEuclidean Algorithm
- Number Theory Basics: Adding on a clock of 12Mathematics
This stop teaches: Modular Arithmetic
- Number Theory Basics: Is 97 prime?Mathematics
This stop teaches: Primality Test
- Number Theory Basics: Prime factors of 360Mathematics
This stop teaches: Prime Factorization
- Number Theory Basics: gcd(48, 18) by EuclidMathematics
Sieve of Eratosthenes1 stop
- Sieve of Eratosthenes: Primes up to 30Mathematics
This stop teaches: Sieve of Eratosthenes
- Sieve of Eratosthenes: Primes up to 30Mathematics
Multiples, Powers, Pascal2 stops
- Multiples, Powers, Pascal: lcm of 4 and 6Mathematics
This stop teaches: Least Common Multiple
- Multiples, Powers, Pascal: C(5, 2)Mathematics
This stop teaches: Pascal's Triangle
- Multiples, Powers, Pascal: lcm of 4 and 6Mathematics
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
Minimum Spanning Tree1 stop
Plane Geometry5 stops
- Plane Geometry: Points, a vector and a distanceComputational Geometry
This stop teaches: Points and VectorsDistanceDot Product
- Plane Geometry: A left turnComputational Geometry
This stop teaches: Cross ProductOrientation
- Plane Geometry: Monotone chain hullComputational Geometry
This stop teaches: Convex Hull
- Plane Geometry: Two segments that crossComputational Geometry
This stop teaches: Segment Intersection
- Plane Geometry: Shoelace area of a pentagonComputational Geometry
This stop teaches: Polygon Area
- Plane Geometry: Points, a vector and a distanceComputational Geometry
Extended Euclid1 stop
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
Multiples, Powers, PascalAgain, 2 stops
- Multiples, Powers, Pascal: 3 to the 6 mod 7Mathematics
This stop teaches: Fermat's Little Theorem
- Multiples, Powers, Pascal: Inverse of 3 mod 11Mathematics
This stop teaches: Modular Inverse
- Multiples, Powers, Pascal: 3 to the 6 mod 7Mathematics
Hash Table4 stops
- Hash Table: Fill a table and watch it collideData Structures
This stop teaches: Hash FunctionHash Table
- Hash Table: Find a key behind a collisionData Structures
This stop teaches: Hash SetHash Table Lookup
- Hash Table: Insert that walks past a collisionData Structures
This stop teaches: Linear ProbingHash Table Insert
- Hash Table: Delete leaves a markerHashing
This stop teaches: Hash Table Delete
- Hash Table: Fill a table and watch it collideData Structures
Hash Map1 stop
Frequency Map1 stop
Prefix Sum and KadaneAgain, 2 stops
String MatchingAgain, 3 stops
- String Matching: Rabin-Karp rolling hashString Algorithms
This stop teaches: Rabin-Karp
- String Matching: Prefix function of a patternString Algorithms
This stop teaches: Prefix Function
- String Matching: KMP, no re-readingString Algorithms
This stop teaches: Knuth-Morris-Pratt
- String Matching: Rabin-Karp rolling hashString Algorithms
XOR TricksAgain, 1 stop
Bitmask2 stops
- Bitmask: A set in one integerBit Manipulation
This stop teaches: Bitmask
- Bitmask: Every subset of threeBit Manipulation
This stop teaches: Subset Enumeration
- Bitmask: A set in one integerBit Manipulation
Bit ManipulationAgain, 2 stops
- Bit Manipulation: 64 is a power of twoBit Manipulation
This stop teaches: Power of Two Check
- Bit Manipulation: Isolate the lowest 1Bit Manipulation
This stop teaches: Lowest Set Bit
- Bit Manipulation: 64 is a power of twoBit Manipulation
Counting and Radix Sort2 stops
- Counting and Radix Sort: Counting sort, repeated keysSorting
This stop teaches: Counting Sort
- Counting and Radix Sort: Radix sort, ones then tensSorting
This stop teaches: Radix Sort
- Counting and Radix Sort: Counting sort, repeated keysSorting
MatrixAgain, 1 stop
- Matrix: 2D prefix sumRange Queries
This stop teaches: 2D Prefix Sum
- Matrix: 2D prefix sumRange Queries
Difference Array1 stop
Flood FillAgain, 1 stop
- Flood Fill: Count the islandsGraph Traversal
This stop teaches: Number of Islands
- Flood Fill: Count the islandsGraph Traversal
Trie3 stops
- Trie: Insert words sharing prefixesData Structures
This stop teaches: TrieTrie Insert
- Trie: Search for a stored wordString Algorithms
This stop teaches: Trie Search
- Trie: Autocomplete: everything under caString Algorithms
This stop teaches: Prefix Search and Autocomplete
- Trie: Insert words sharing prefixesData Structures
DP on a GridAgain, 1 stop
- DP on a Grid: Cheapest pathDynamic Programming
This stop teaches: Minimum Path Sum
- DP on a Grid: Cheapest pathDynamic Programming
Knapsack2 stops
- Knapsack: 0/1 knapsack, capacity 7Dynamic Programming
This stop teaches: 0/1 Knapsack
- Knapsack: Unbounded, the same itemsDynamic Programming
This stop teaches: Unbounded Knapsack
- Knapsack: 0/1 knapsack, capacity 7Dynamic Programming
String DP3 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: Longest common substringDynamic Programming
This stop teaches: Longest Common Substring
- String DP: LCS of abcde and aceDynamic Programming
All-Pairs Shortest Paths1 stop
BST QueriesAgain, 3 stops
- BST Queries: Successor from an ancestorTree Algorithms
This stop teaches: Successor and Predecessor
- BST Queries: Values between 35 and 65Tree Algorithms
This stop teaches: BST Range Search
- BST Queries: Lowest common ancestorTree Algorithms
This stop teaches: Lowest Common Ancestor
- BST Queries: Successor from an ancestorTree Algorithms
Binary Search TreeAgain, 1 stop
DFS ChecksAgain, 2 stops
- DFS Checks: An undirected cycleGraph Traversal
This stop teaches: Cycle Detection
- DFS Checks: Two-colouring an even cycleGraph Traversal
This stop teaches: Bipartite Check
- DFS Checks: An undirected cycleGraph Traversal
Topological Sort2 stops
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
K-th Largest1 stop
- K-th Largest: Third largest of nineHeap Algorithms
This stop teaches: K-th Largest / Smallest
- K-th Largest: Third largest of nineHeap Algorithms
Heap Sort1 stop
- Heap Sort: Eight valuesSorting
This stop teaches: Heap Sort
- Heap Sort: Eight valuesSorting
Merging Sorted ListsAgain, 1 stop
Shortest PathsAgain, 1 stop
- Shortest Paths: Bellman-Ford from 0Shortest Path
This stop teaches: Bellman-Ford
- Shortest Paths: Bellman-Ford from 0Shortest Path
Huffman Coding1 stop
Union-Find2 stops
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 Row6 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: House robberDynamic Programming
This stop teaches: House Robber
- DP in One Row: Fewest coins for 6 from 1, 3, 4Dynamic Programming
This stop teaches: Coin Change
- DP in One Row: Maximum subarrayDynamic Programming
This stop teaches: Maximum Subarray (DP view)
- DP in One Row: Longest increasing subsequenceDynamic Programming
This stop teaches: Longest Increasing Subsequence
- DP in One Row: Fibonacci by tableDynamic Programming
Merge Sort1 stop
- Merge Sort: Eight valuesSorting
This stop teaches: Merge Sort
- Merge Sort: Eight valuesSorting
Minimum Spanning TreeAgain, 1 stop
- Minimum Spanning Tree: Prim, growing from 0Minimum Spanning Tree
This stop teaches: Prim
- Minimum Spanning Tree: Prim, growing from 0Minimum Spanning Tree
Two Pointer Problems2 stops
- Two Pointer Problems: Three sum to zeroTwo Pointers
This stop teaches: Three Sum
- Two Pointer Problems: Container with most waterTwo Pointers
This stop teaches: Container With Most Water
- Two Pointer Problems: Three sum to zeroTwo Pointers
Build and Validate a BST2 stops
Backtracking3 stops
- Backtracking: 4 queens, with backtrackingBacktracking
This stop teaches: BacktrackingN-Queens
- Backtracking: A maze with a dead endBacktracking
This stop teaches: Rat in a Maze
- Backtracking: Word search with a dead endBacktracking
This stop teaches: Word Search
- Backtracking: 4 queens, with backtrackingBacktracking
Enumeration4 stops
- Enumeration: All orderings of threeBacktracking
This stop teaches: Permutations
- Enumeration: All subsets of threeBacktracking
This stop teaches: Subsets
- Enumeration: Choose 2 of 4Backtracking
This stop teaches: Combinations
- Enumeration: Sums to 7 with repeats allowedBacktracking
This stop teaches: Combination Sum
- Enumeration: All orderings of threeBacktracking
Monotonic Stack1 stop
Stacks for ExpressionsAgain, 2 stops
The Call StackAgain, 1 stop
Complexity in NumbersAgain, 2 stops
Rehashing2 stops
- Rehashing: One rehashHashing
This stop teaches: Rehashing
- Rehashing: Collisions before the rehashHashing
This stop teaches: Load Factor
- Rehashing: One rehashHashing
Greedy Choice1 stop
- Greedy Choice: Coins where greedy failsAlgorithmic Paradigms
This stop teaches: Greedy
- Greedy Choice: Coins where greedy failsAlgorithmic Paradigms
Fractional Knapsack1 stop
- Fractional Knapsack: The classic three itemsGreedy
This stop teaches: Fractional Knapsack
- Fractional Knapsack: The classic three itemsGreedy
Intervals and Greedy Choices3 stops
- Intervals and Greedy Choices: Assigning roomsGreedy
This stop teaches: Interval Partitioning
- Intervals and Greedy Choices: How many roomsGreedy
This stop teaches: Meeting Rooms
- Intervals and Greedy Choices: Earliest finish firstGreedy
This stop teaches: Interval Scheduling
- Intervals and Greedy Choices: Assigning roomsGreedy
Fast and Slow Pointers4 stops
- Fast and Slow Pointers: Find the middle of sevenTwo Pointers
This stop teaches: Fast and Slow PointersFind Middle
- Fast and Slow Pointers: A list that loopsLinked List Algorithms
This stop teaches: Detect Cycle
- Fast and Slow Pointers: Where the loop beginsLinked List Algorithms
This stop teaches: Find Cycle Entry
- Fast and Slow Pointers: Remove the 2nd from the endLinked List Algorithms
This stop teaches: Remove Nth From End
- Fast and Slow Pointers: Find the middle of sevenTwo Pointers
Quick Sort1 stop
- Quick Sort: Seven valuesArray Algorithms and Techniques
This stop teaches: PartitionQuick Sort
- Quick Sort: Seven valuesArray Algorithms and Techniques
Rotate, Partition, Select3 stops
- Rotate, Partition, Select: The 4th smallestSorting
This stop teaches: Quickselect
- Rotate, Partition, Select: Sort into less, equal, greaterArray Algorithms and Techniques
This stop teaches: Dutch National Flag
- Rotate, Partition, Select: Rotate right by 3Array Algorithms and Techniques
This stop teaches: Rotate Array
- Rotate, Partition, Select: The 4th smallestSorting
Sliding Window2 stops
Frequency Map Window1 stop
- Frequency Map Window: At most 2 distinctSliding Window
This stop teaches: Frequency Map + Window
- Frequency Map Window: At most 2 distinctSliding Window
Substring Windows1 stop
Sliding Window Maximum1 stop
- Sliding Window Maximum: Maximum of every 3Data Structures
This stop teaches: Monotonic Queue
- Sliding Window Maximum: Maximum of every 3Data Structures
Search on the Answer1 stop
Segment Tree1 stop
- Segment Tree: Minimum of indices 1 to 6Range Queries
This stop teaches: Range Minimum Query
- Segment Tree: Minimum of indices 1 to 6Range Queries
AVL Tree4 stops
- AVL Tree: A longer mixed sequenceData Structures
This stop teaches: AVL Tree
- AVL Tree: Already balanced, no rotationsTree Algorithms
This stop teaches: Balance Factor
- AVL Tree: Right-right needs a left rotationTree Algorithms
This stop teaches: Left Rotation
- AVL Tree: Left-left needs a right rotationTree Algorithms
This stop teaches: Right Rotation
- AVL Tree: A longer mixed sequenceData Structures
Not this one?
Foundations covers the same curriculum with a different reach, and every topic is reachable on its own, grouped by category.