5 QUESTIONS
Q1 1 / 5 medium
BFS on Grid — Shortest Path
Given a grid with empty cells . and walls #, find the shortest path from top-left (0,0) to bottom-right (n-1,m-1). You can move in 4 directions.
What is the key data structure or technique required?