← Questions
Shortest path in a grid with obstacle elimination
0
I was asked this
No reports yet. Sign in to say where you were asked it.
A grid has empty cells and obstacles. Find the fewest steps from the top-left to the bottom-right cell moving up, down, left or right, when you may remove up to k obstacles along the way. Return -1 if the target cannot be reached.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding