AlgoScope

Foundations

The essentials, in an order you can follow from zero.

Your progress on Foundations

89 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. Insertion Sort1 stop
    1. Insertion SortSorting

      This stop teaches: Insertion Sort

  6. Selection Sort1 stop
    1. Selection SortSorting

      This stop teaches: Selection Sort

  7. Dynamic Array1 stop
    1. Dynamic ArrayData Structures

      This stop teaches: Dynamic Array

  8. 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

  9. 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 Bits

    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

  10. Number Theory Basics3 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

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

      This stop teaches: Sieve of Eratosthenes

  12. 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

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

      This stop teaches: Best, Average and Worst Case

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

      This stop teaches: Brute Force

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

      This stop teaches: Merge Two Sorted Lists

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

      This stop teaches: QueueDequeueEnqueue

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

      This stop teaches: StackPeekPopPush

  18. 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

  19. 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

  20. 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 Search

    3. BFS and DFS: Three componentsGraph Traversal

      This stop teaches: Connected Components

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

      This stop teaches: DFS Recursive

  22. 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

  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. String Matching1 stop
    1. String Matching: Naive, every shiftData Structures

      This stop teaches: StringNaive Pattern Matching

  27. Stacks for Expressions1 stop
    1. Stacks for Expressions: Balanced bracketsStack and Queue Algorithms

      This stop teaches: Balanced Parentheses

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

      This stop teaches: Matrix

    2. Matrix: Adjacency matrix from edgesData Structures

      This stop teaches: Adjacency Matrix

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

      This stop teaches: Flood Fill

  30. Prefix Sum and Kadane2 stops
    1. Prefix Sum and Kadane: Range sum from prefix totalsArray Algorithms and Techniques

      This stop teaches: Prefix Sum

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

      This stop teaches: Kadane's Algorithm

  31. Knapsack1 stop
    1. Knapsack: 0/1 knapsack, capacity 7Dynamic Programming

      This stop teaches: 0/1 Knapsack

  32. String DP2 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

  33. BST QueriesAgain, 1 stop
    1. BST Queries: Successor from an ancestorTree Algorithms

      This stop teaches: Successor and Predecessor

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

      This stop teaches: BST Delete

  35. 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

  36. Backtracking1 stop
    1. Backtracking: 4 queens, with backtrackingBacktracking

      This stop teaches: BacktrackingN-Queens

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

      This stop teaches: Greedy

  38. Hash Table3 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 collisionHashing

      This stop teaches: Hash Table Insert

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

      This stop teaches: Hash Map

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

      This stop teaches: Frequency Map / Hashing

  41. Enumeration2 stops
    1. Enumeration: All orderings of threeBacktracking

      This stop teaches: Permutations

    2. Enumeration: All subsets of threeBacktracking

      This stop teaches: Subsets

  42. 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

  43. DP in One Row3 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: Fewest coins for 6 from 1, 3, 4Dynamic Programming

      This stop teaches: Coin Change

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

      This stop teaches: Merge Sort

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

      This stop teaches: Fast Exponentiation

  46. Fast and Slow Pointers2 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

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

      This stop teaches: PartitionQuick Sort

  48. 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

Not this one?

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