Skip to main content
← All courses
🧩

Algorithm Projects

JavaScript

Go beyond toy exercises — build five complete algorithm projects that show real CS depth. BFS mazes, Dijkstra paths, Sudoku validation, A* grid search, and a sorting visualiser backend.

Your progress

0/5 complete

Start → Maze Solver (BFS)
  1. 1

    Maze Solver (BFS)

    Find the shortest path through a 2-D grid using Breadth-First Search.

    ⚡ 40
  2. 2

    Dijkstra's Shortest Path

    Find cheapest routes in a weighted graph — the algorithm behind GPS navigation.

    ⚡ 50
  3. 3

    Sudoku Validator

    Validate a 9×9 Sudoku board using sets — a Google/Meta interview classic.

    ⚡ 40
  4. 4

    A* Pathfinding on a Grid

    The algorithm that powers game AI and Google Maps — smarter than BFS.

    ⚡ 60
  5. 5

    Sorting Steps Generator

    Produce every swap step of a sort — the back-end for a sorting visualiser.

    ⚡ 50