hard20 pts · first answer countsgraphsbfsstate-space

Shortest path with k walls you can break

You may break through at most k walls on a grid. Why does a visited set keyed only by (row, col) give wrong answers?

A.BFS cannot be used at all on grids that contain wallsB.Every wall cell has to be visited exactly twiceC.Reaching a cell with more breaks left is a different, better stateD.The queue must stay sorted by the number of walls broken

Discussion 0

Join free to post in the discussion.

Shortest path with k walls you can break

Discussion 0

Related questions