Problem bank
HardGraphsNeetCode 150 · #92/150

Word Ladder

  1. 1
    Learn the pattern

    Grid or network traversal → BFS for shortest path, DFS for connectivity/shape. Track visited on push.

  2. 2
    Trace your version

    Paste your solution into the workspace and watch every step execute.

    Open workspace
  3. 3
    Solve it

    Solve it on LeetCode, then mark it solved here to keep your streak alive.

Graph Valid TreeReconstruct Itinerary