Shortest Path in Binary Matrix (LC #1091) finds the shortest clear path from top-left to bottom-right. A clear path visits only s and can move in directions. Use BFS from the start cell, tracking distance. For each cell, try all neighbors. Mark cells as visited when adding to queue to avoid duplicates. Return distance when you reach the bottom-right. If the start or end is , return . This runs in time and space. Meta confirmed this as an E4 onsite question.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/meta-interview-prep/graphs/shortest-path-in-binary-matrix
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████████████████████████████