Intermediate · Coding interviews: lists, trees and graphs
Graph search
Six interview problems on searching graphs, breadth first and depth first: counting islands on a map, the shortest way out of a maze, a fire spreading from many places at once, copying a graph with cycles, a word ladder whose links are never written down, and splitting a team into two groups.
- You build
- islands.py, then maze.py, then fire.py, then copy_graph.py, then ladder.py, then groups.py
- Stages
- 6 Problems
- Time
- About 2.5 hours
Loading the workspace…
Loading the workspace…