AlgoScope

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

  1. Array4 stops
    1. Array: Insert 7 at index 2Data Structures

      This stop teaches: ArrayArray Insert

    2. Array: Delete index 1Array Algorithms and Techniques

      This stop teaches: Array Delete

    3. Array: Visit every slotArray Algorithms and Techniques

      This stop teaches: Array Traversal

    4. Array: Linear search, foundSearching

      This stop teaches: Linear Search

  2. Binary Search1 stop
    1. Binary SearchSearching

      This stop teaches: Binary Search

  3. Two Pointers3 stops
    1. Two Pointers: Two sum on a sorted arrayArray Algorithms and Techniques

      This stop teaches: Two Pointer TraversalTwo PointersOpposite Direction PointersTwo Sum (sorted)

    2. Two Pointers: Remove duplicatesTwo Pointers

      This stop teaches: Same Direction PointersRemove Duplicates from Sorted Array

    3. Two Pointers: Reverse in placeArray Algorithms and Techniques

      This stop teaches: Reverse Array

  4. Bubble Sort1 stop
    1. Bubble SortSorting

      This stop teaches: Bubble Sort

  5. Stable Sorting1 stop
    1. Stable Sorting: Selection sort flips itComplexity Analysis

      This stop teaches: Stable Sorting

  6. Insertion Sort1 stop
    1. Insertion SortSorting

      This stop teaches: Insertion Sort

  7. Selection Sort1 stop
    1. Selection SortSorting

      This stop teaches: Selection Sort

  8. Dynamic Array1 stop
    1. Dynamic ArrayData Structures

      This stop teaches: Dynamic Array

  9. Singly Linked List6 stops
    1. Singly Linked List: Reverse the listData Structures

      This stop teaches: Singly Linked ListReverse Linked List

    2. Singly Linked List: Insert at the headLinked List Algorithms

      This stop teaches: Insert at Head

    3. Singly Linked List: Insert at index 2Linked List Algorithms

      This stop teaches: Insert at Position

    4. Singly Linked List: TraverseLinked List Algorithms

      This stop teaches: Traversal

    5. Singly Linked List: Delete 4Linked List Algorithms

      This stop teaches: Delete Node

    6. Singly Linked List: Insert at the tailLinked List Algorithms

      This stop teaches: Insert at Tail

  10. Complexity in Numbers2 stops
    1. Complexity in Numbers: Six classes as n doublesComplexity Analysis

      This stop teaches: Big O

    2. Complexity in Numbers: Extra memory, stack includedComplexity Analysis

      This stop teaches: Space Complexity

  11. Best, Average, Worst1 stop
    1. Best, Average, Worst: Worst case: reversedComplexity Analysis

      This stop teaches: Best, Average and Worst Case

  12. Brute Force1 stop
    1. Brute Force: Found near the endAlgorithmic Paradigms

      This stop teaches: Brute Force

  13. Merging Sorted Lists1 stop
    1. Merging Sorted Lists: Two lists, interleavingLinked List Algorithms

      This stop teaches: Merge Two Sorted Lists

  14. LRU Cache1 stop
    1. LRU Cache: A hit moves the node to the frontData Structures

      This stop teaches: Doubly Linked ListLRU Cache

  15. Queue1 stop
    1. Queue: Enqueue, dequeue, peekData Structures

      This stop teaches: QueueDequeueEnqueue

  16. Circular Queue1 stop
    1. Circular Queue: Rear wraps aroundData Structures

      This stop teaches: Circular Queue

  17. Deque1 stop
    1. Deque: Push and pop at both endsData Structures

      This stop teaches: Deque

  18. Stack1 stop
    1. Stack: Push, pop, peekData Structures

      This stop teaches: StackPeekPopPush

  19. The Call Stack3 stops
    1. The Call Stack: fact(5) down and back upData Structures

      This stop teaches: Call Stack

    2. The Call Stack: Summing a list recursivelyRecursion

      This stop teaches: Recursion

    3. The Call Stack: No base case, stack overflowRecursion

      This stop teaches: Base Case and Recursive Case

  20. Tree Traversals4 stops
    1. Tree Traversals: Inorder comes out sortedData Structures

      This stop teaches: Binary TreeInorder Traversal

    2. Tree Traversals: Level order uses a queueTree Algorithms

      This stop teaches: Level Order Traversal

    3. Tree Traversals: Postorder, root comes lastTree Algorithms

      This stop teaches: Postorder Traversal

    4. Tree Traversals: Preorder, node before subtreesTree Algorithms

      This stop teaches: Preorder Traversal

  21. BFS and DFS3 stops
    1. BFS and DFS: Breadth-first from 0Data Structures

      This stop teaches: GraphAdjacency ListBreadth-First Search

    2. BFS and DFS: Depth-first from 0Graph Traversal

      This stop teaches: Depth-First SearchDFS Iterative

    3. BFS and DFS: Three componentsGraph Traversal

      This stop teaches: Connected Components

  22. DFS Checks1 stop
    1. DFS Checks: Recursive DFS and its call stackGraph Traversal

      This stop teaches: DFS Recursive

  23. Binary Search Tree2 stops
    1. Binary Search Tree: Search for 45Data Structures

      This stop teaches: Binary Search TreeBST Search

    2. Binary Search Tree: Insert 65Tree Algorithms

      This stop teaches: BST Insert

  24. BST Queries1 stop
    1. BST Queries: Find the minimumTree Algorithms

      This stop teaches: Find Minimum and Maximum

  25. DP on a Grid1 stop
    1. DP on a Grid: Paths on a 3 x 4 gridDynamic Programming

      This stop teaches: Base CaseTabulationUnique Grid Paths

  26. Stacks for Expressions1 stop
    1. Stacks for Expressions: Evaluate postfixStack and Queue Algorithms

      This stop teaches: Postfix Evaluation

  27. String Matching1 stop
    1. String Matching: Naive, every shiftData Structures

      This stop teaches: StringNaive Pattern Matching

  28. Stacks for ExpressionsAgain, 1 stop
    1. Stacks for Expressions: Balanced bracketsStack and Queue Algorithms

      This stop teaches: Balanced Parentheses

  29. Matrix2 stops
    1. Matrix: Row-major orderData Structures

      This stop teaches: Matrix

    2. Matrix: Adjacency matrix from edgesData Structures

      This stop teaches: Adjacency Matrix

  30. Flood Fill1 stop
    1. Flood Fill: Fill a regionGraph Traversal

      This stop teaches: Flood Fill

  31. Prefix Sum and Kadane1 stop
    1. Prefix Sum and Kadane: Range sum from prefix totalsArray Algorithms and Techniques

      This stop teaches: Prefix SumRange Sum Query

  32. Bit Manipulation5 stops
    1. Bit Manipulation: Read one bitBit Manipulation

      This stop teaches: Get Bit

    2. Bit Manipulation: Clear a bit that was 1Bit Manipulation

      This stop teaches: Clear Bit

    3. Bit Manipulation: Count the 1s, Kernighan styleBit Manipulation

      This stop teaches: Count Set BitsBrian Kernighan's Algorithm

    4. Bit Manipulation: Set a bit that was 0Bit Manipulation

      This stop teaches: Set Bit

    5. Bit Manipulation: Flip a bitBit Manipulation

      This stop teaches: Toggle Bit

  33. XOR Tricks1 stop
    1. XOR Tricks: Swap without a temporaryBit Manipulation

      This stop teaches: XOR Properties

  34. Number Theory Basics4 stops
    1. Number Theory Basics: gcd(48, 18) by EuclidMathematics

      This stop teaches: Greatest Common DivisorEuclidean Algorithm

    2. Number Theory Basics: Adding on a clock of 12Mathematics

      This stop teaches: Modular Arithmetic

    3. Number Theory Basics: Is 97 prime?Mathematics

      This stop teaches: Primality Test

    4. Number Theory Basics: Prime factors of 360Mathematics

      This stop teaches: Prime Factorization

  35. Sieve of Eratosthenes1 stop
    1. Sieve of Eratosthenes: Primes up to 30Mathematics

      This stop teaches: Sieve of Eratosthenes

  36. Multiples, Powers, Pascal2 stops
    1. Multiples, Powers, Pascal: lcm of 4 and 6Mathematics

      This stop teaches: Least Common Multiple

    2. Multiples, Powers, Pascal: C(5, 2)Mathematics

      This stop teaches: Pascal's Triangle

  37. Shortest Paths2 stops
    1. Shortest Paths: Dijkstra on directed edgesData Structures

      This stop teaches: Directed Graph

    2. Shortest Paths: Dijkstra from 0Data Structures

      This stop teaches: Weighted GraphDijkstra

  38. Minimum Spanning Tree1 stop
    1. Minimum Spanning Tree: Kruskal, cheapest edges firstData Structures

      This stop teaches: Edge ListKruskal

  39. Plane Geometry5 stops
    1. Plane Geometry: Points, a vector and a distanceComputational Geometry

      This stop teaches: Points and VectorsDistanceDot Product

    2. Plane Geometry: A left turnComputational Geometry

      This stop teaches: Cross ProductOrientation

    3. Plane Geometry: Monotone chain hullComputational Geometry

      This stop teaches: Convex Hull

    4. Plane Geometry: Two segments that crossComputational Geometry

      This stop teaches: Segment Intersection

    5. Plane Geometry: Shoelace area of a pentagonComputational Geometry

      This stop teaches: Polygon Area

  40. Extended Euclid1 stop
    1. Extended Euclid: gcd(48, 18) with coefficientsMathematics

      This stop teaches: Extended Euclidean Algorithm

  41. Number Theory BasicsAgain, 1 stop
    1. Number Theory Basics: 3 to the 13, mod 7Mathematics

      This stop teaches: Fast Exponentiation

  42. Multiples, Powers, PascalAgain, 2 stops
    1. Multiples, Powers, Pascal: 3 to the 6 mod 7Mathematics

      This stop teaches: Fermat's Little Theorem

    2. Multiples, Powers, Pascal: Inverse of 3 mod 11Mathematics

      This stop teaches: Modular Inverse

  43. Hash Table4 stops
    1. Hash Table: Fill a table and watch it collideData Structures

      This stop teaches: Hash FunctionHash Table

    2. Hash Table: Find a key behind a collisionData Structures

      This stop teaches: Hash SetHash Table Lookup

    3. Hash Table: Insert that walks past a collisionData Structures

      This stop teaches: Linear ProbingHash Table Insert

    4. Hash Table: Delete leaves a markerHashing

      This stop teaches: Hash Table Delete

  44. Hash Map1 stop
    1. Hash Map: Filling buckets, with collisionsData Structures

      This stop teaches: Hash MapSeparate Chaining

  45. Frequency Map1 stop
    1. Frequency Map: First value seen beforeProblem-Solving Patterns

      This stop teaches: Frequency Map / Hashing

  46. Prefix Sum and KadaneAgain, 2 stops
    1. Prefix Sum and Kadane: Count subarrays summing to 7Array Algorithms and Techniques

      This stop teaches: Subarray Sum Patterns

    2. Prefix Sum and Kadane: Kadane on a mixed arrayArray Algorithms and Techniques

      This stop teaches: Kadane's AlgorithmMaximum Subarray

  47. String MatchingAgain, 3 stops
    1. String Matching: Rabin-Karp rolling hashString Algorithms

      This stop teaches: Rabin-Karp

    2. String Matching: Prefix function of a patternString Algorithms

      This stop teaches: Prefix Function

    3. String Matching: KMP, no re-readingString Algorithms

      This stop teaches: Knuth-Morris-Pratt

  48. XOR TricksAgain, 1 stop
    1. XOR Tricks: Find the single numberBit Manipulation

      This stop teaches: XOR Pairing (Single Number)

  49. Bitmask2 stops
    1. Bitmask: A set in one integerBit Manipulation

      This stop teaches: Bitmask

    2. Bitmask: Every subset of threeBit Manipulation

      This stop teaches: Subset Enumeration

  50. Bit ManipulationAgain, 2 stops
    1. Bit Manipulation: 64 is a power of twoBit Manipulation

      This stop teaches: Power of Two Check

    2. Bit Manipulation: Isolate the lowest 1Bit Manipulation

      This stop teaches: Lowest Set Bit

  51. Counting and Radix Sort2 stops
    1. Counting and Radix Sort: Counting sort, repeated keysSorting

      This stop teaches: Counting Sort

    2. Counting and Radix Sort: Radix sort, ones then tensSorting

      This stop teaches: Radix Sort

  52. MatrixAgain, 1 stop
    1. Matrix: 2D prefix sumRange Queries

      This stop teaches: 2D Prefix Sum

  53. Difference Array1 stop
    1. Difference Array: Three overlapping rangesArray Algorithms and Techniques

      This stop teaches: Difference Array

  54. Flood FillAgain, 1 stop
    1. Flood Fill: Count the islandsGraph Traversal

      This stop teaches: Number of Islands

  55. Trie3 stops
    1. Trie: Insert words sharing prefixesData Structures

      This stop teaches: TrieTrie Insert

    2. Trie: Search for a stored wordString Algorithms

      This stop teaches: Trie Search

    3. Trie: Autocomplete: everything under caString Algorithms

      This stop teaches: Prefix Search and Autocomplete

  56. DP on a GridAgain, 1 stop
    1. DP on a Grid: Cheapest pathDynamic Programming

      This stop teaches: Minimum Path Sum

  57. Knapsack2 stops
    1. Knapsack: 0/1 knapsack, capacity 7Dynamic Programming

      This stop teaches: 0/1 Knapsack

    2. Knapsack: Unbounded, the same itemsDynamic Programming

      This stop teaches: Unbounded Knapsack

  58. String DP3 stops
    1. String DP: LCS of abcde and aceDynamic Programming

      This stop teaches: Longest Common Subsequence

    2. String DP: kitten to sittingDynamic Programming

      This stop teaches: Edit Distance

    3. String DP: Longest common substringDynamic Programming

      This stop teaches: Longest Common Substring

  59. All-Pairs Shortest Paths1 stop
    1. All-Pairs Shortest Paths: Four vertices, three rounds of gainsShortest Path

      This stop teaches: Floyd-Warshall

  60. BST QueriesAgain, 3 stops
    1. BST Queries: Successor from an ancestorTree Algorithms

      This stop teaches: Successor and Predecessor

    2. BST Queries: Values between 35 and 65Tree Algorithms

      This stop teaches: BST Range Search

    3. BST Queries: Lowest common ancestorTree Algorithms

      This stop teaches: Lowest Common Ancestor

  61. Binary Search TreeAgain, 1 stop
    1. Binary Search Tree: Delete a node with two children (30)Tree Algorithms

      This stop teaches: BST Delete

  62. DFS ChecksAgain, 2 stops
    1. DFS Checks: An undirected cycleGraph Traversal

      This stop teaches: Cycle Detection

    2. DFS Checks: Two-colouring an even cycleGraph Traversal

      This stop teaches: Bipartite Check

  63. Topological Sort2 stops
    1. Topological Sort: Kahn's algorithmData Structures

      This stop teaches: Directed Acyclic GraphKahn's Algorithm

    2. Topological Sort: DFS finish orderConnectivity and Topological Order

      This stop teaches: DFS Topological Sort

  64. Binary Heap4 stops
    1. Binary Heap: Build a min heapData Structures

      This stop teaches: Binary HeapMin HeapHeapify (Build Heap)

    2. Binary Heap: Build a max heapData Structures

      This stop teaches: Max Heap

    3. Binary Heap: Insert climbs to the rootData Structures

      This stop teaches: Priority QueueSift UpHeap Insert

    4. Binary Heap: Extract the minimumHeap Algorithms

      This stop teaches: Sift DownExtract Min / Max

  65. K-th Largest1 stop
    1. K-th Largest: Third largest of nineHeap Algorithms

      This stop teaches: K-th Largest / Smallest

  66. Heap Sort1 stop
    1. Heap Sort: Eight valuesSorting

      This stop teaches: Heap Sort

  67. Merging Sorted ListsAgain, 1 stop
    1. Merging Sorted Lists: Three lists through a heapLinked List Algorithms

      This stop teaches: Merge K Sorted Lists

  68. Shortest PathsAgain, 1 stop
    1. Shortest Paths: Bellman-Ford from 0Shortest Path

      This stop teaches: Bellman-Ford

  69. Huffman Coding1 stop
    1. Huffman Coding: The classic: five characters, very skewedGreedy

      This stop teaches: Huffman Coding

  70. Union-Find2 stops
    1. Union-Find: Merging sets by sizeData Structures

      This stop teaches: Disjoint Set Union

    2. Union-Find: Path compression at workConnectivity and Topological Order

      This stop teaches: Union-Find Operations

  71. Recursion Trees3 stops
    1. Recursion Trees: Divide and conquer over a rangeDivide and Conquer

      This stop teaches: Divide and Conquer

    2. Recursion Trees: fib(5), the plain treeDynamic Programming

      This stop teaches: Overlapping Subproblems

    3. Recursion Trees: fib(6) with memoizationDynamic Programming

      This stop teaches: MemoizationDynamic Programming

  72. DP in One Row6 stops
    1. DP in One Row: Fibonacci by tableDynamic Programming

      This stop teaches: Fibonacci

    2. DP in One Row: Ways to climb 8 stairsDynamic Programming

      This stop teaches: Climbing Stairs

    3. DP in One Row: House robberDynamic Programming

      This stop teaches: House Robber

    4. DP in One Row: Fewest coins for 6 from 1, 3, 4Dynamic Programming

      This stop teaches: Coin Change

    5. DP in One Row: Maximum subarrayDynamic Programming

      This stop teaches: Maximum Subarray (DP view)

    6. DP in One Row: Longest increasing subsequenceDynamic Programming

      This stop teaches: Longest Increasing Subsequence

  73. Merge Sort1 stop
    1. Merge Sort: Eight valuesSorting

      This stop teaches: Merge Sort

  74. Minimum Spanning TreeAgain, 1 stop
    1. Minimum Spanning Tree: Prim, growing from 0Minimum Spanning Tree

      This stop teaches: Prim

  75. Two Pointer Problems2 stops
    1. Two Pointer Problems: Three sum to zeroTwo Pointers

      This stop teaches: Three Sum

    2. Two Pointer Problems: Container with most waterTwo Pointers

      This stop teaches: Container With Most Water

  76. Build and Validate a BST2 stops
    1. Build and Validate a BST: Seven sorted values, balancedTree Algorithms

      This stop teaches: BST from Sorted Array

    2. Build and Validate a BST: Swap two values and catch itTree Algorithms

      This stop teaches: Validate BST

  77. Backtracking3 stops
    1. Backtracking: 4 queens, with backtrackingBacktracking

      This stop teaches: BacktrackingN-Queens

    2. Backtracking: A maze with a dead endBacktracking

      This stop teaches: Rat in a Maze

    3. Backtracking: Word search with a dead endBacktracking

      This stop teaches: Word Search

  78. Enumeration4 stops
    1. Enumeration: All orderings of threeBacktracking

      This stop teaches: Permutations

    2. Enumeration: All subsets of threeBacktracking

      This stop teaches: Subsets

    3. Enumeration: Choose 2 of 4Backtracking

      This stop teaches: Combinations

    4. Enumeration: Sums to 7 with repeats allowedBacktracking

      This stop teaches: Combination Sum

  79. Monotonic Stack1 stop
    1. Monotonic Stack: Next greater elementData Structures

      This stop teaches: Monotonic StackNext Greater Element

  80. Stacks for ExpressionsAgain, 2 stops
    1. Stacks for Expressions: Evaluate infix with two stacksStack and Queue Algorithms

      This stop teaches: Expression Evaluation

    2. Stacks for Expressions: Infix to postfixStack and Queue Algorithms

      This stop teaches: Infix to Postfix

  81. The Call StackAgain, 1 stop
    1. The Call Stack: Tail recursion reuses the frameRecursion

      This stop teaches: Recursion to Iteration

  82. Complexity in NumbersAgain, 2 stops
    1. Complexity in Numbers: Appends to a doubling arrayComplexity Analysis

      This stop teaches: Amortized Analysis

    2. Complexity in Numbers: 3n + 5 is Theta(n)Complexity Analysis

      This stop teaches: Big Omega

  83. Rehashing2 stops
    1. Rehashing: One rehashHashing

      This stop teaches: Rehashing

    2. Rehashing: Collisions before the rehashHashing

      This stop teaches: Load Factor

  84. Greedy Choice1 stop
    1. Greedy Choice: Coins where greedy failsAlgorithmic Paradigms

      This stop teaches: Greedy

  85. Fractional Knapsack1 stop
    1. Fractional Knapsack: The classic three itemsGreedy

      This stop teaches: Fractional Knapsack

  86. Intervals and Greedy Choices3 stops
    1. Intervals and Greedy Choices: Assigning roomsGreedy

      This stop teaches: Interval Partitioning

    2. Intervals and Greedy Choices: How many roomsGreedy

      This stop teaches: Meeting Rooms

    3. Intervals and Greedy Choices: Earliest finish firstGreedy

      This stop teaches: Interval Scheduling

  87. Fast and Slow Pointers4 stops
    1. Fast and Slow Pointers: Find the middle of sevenTwo Pointers

      This stop teaches: Fast and Slow PointersFind Middle

    2. Fast and Slow Pointers: A list that loopsLinked List Algorithms

      This stop teaches: Detect Cycle

    3. Fast and Slow Pointers: Where the loop beginsLinked List Algorithms

      This stop teaches: Find Cycle Entry

    4. Fast and Slow Pointers: Remove the 2nd from the endLinked List Algorithms

      This stop teaches: Remove Nth From End

  88. Quick Sort1 stop
    1. Quick Sort: Seven valuesArray Algorithms and Techniques

      This stop teaches: PartitionQuick Sort

  89. Rotate, Partition, Select3 stops
    1. Rotate, Partition, Select: The 4th smallestSorting

      This stop teaches: Quickselect

    2. Rotate, Partition, Select: Sort into less, equal, greaterArray Algorithms and Techniques

      This stop teaches: Dutch National Flag

    3. Rotate, Partition, Select: Rotate right by 3Array Algorithms and Techniques

      This stop teaches: Rotate Array

  90. Sliding Window2 stops
    1. Sliding Window: Largest sum of 3 in a rowSliding Window

      This stop teaches: Sliding WindowFixed-Size WindowMaximum Sum Subarray of Size k

    2. Sliding Window: Shortest run summing to 7Sliding Window

      This stop teaches: Variable-Size Window

  91. Frequency Map Window1 stop
    1. Frequency Map Window: At most 2 distinctSliding Window

      This stop teaches: Frequency Map + Window

  92. Substring Windows1 stop
    1. Substring Windows: Longest run without a repeatSliding Window

      This stop teaches: Longest Substring Without Repeating Characters

  93. Sliding Window Maximum1 stop
    1. Sliding Window Maximum: Maximum of every 3Data Structures

      This stop teaches: Monotonic Queue

  94. Search on the Answer1 stop
    1. Search on the Answer: Least ship capacity in 5 daysProblem-Solving Patterns

      This stop teaches: Binary Search on Answer

  95. Segment Tree1 stop
    1. Segment Tree: Minimum of indices 1 to 6Range Queries

      This stop teaches: Range Minimum Query

  96. AVL Tree4 stops
    1. AVL Tree: A longer mixed sequenceData Structures

      This stop teaches: AVL Tree

    2. AVL Tree: Already balanced, no rotationsTree Algorithms

      This stop teaches: Balance Factor

    3. AVL Tree: Right-right needs a left rotationTree Algorithms

      This stop teaches: Left Rotation

    4. AVL Tree: Left-left needs a right rotationTree Algorithms

      This stop teaches: Right Rotation

Not this one?

Foundations covers the same curriculum with a different reach, and every topic is reachable on its own, grouped by category.