Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Shortest Path in a Grid with Obstacles Elimination

Understand how to apply BFS to solve the shortest path in a grid problem where obstacles can be eliminated. Explore encoding states with remaining eliminations to navigate the grid efficiently and find the minimum steps needed or determine if no valid path exists.

We'll cover the following...

Statement

Given an m x n integer matrix grid, where each cell contains either 00 (empty) or 11 (obstacle), you may move one step at a time in any of the four directions (up, down, left, right), but only into empty cells.

Return the minimum number of steps required to travel from the upper-left corner ((0, 0 ...