Least You Need to Know: Grid Traversal, Flood Fill, and Boundary Checks
Ouvrir la leçon
Many interview grid problems are just implicit graph traversal: each cell is a node, legal moves define edges, and BFS or DFS visits connected components or shortest paths. The main implementation risk is careful neighbor and boundary handling.