← Questions
Fewest moves across a grid when each move can jump up to k cells
0
I was asked this
No reports yet. Sign in to say where you were asked it.
On a grid with blocked cells, each move goes up, down, left or right by one to k cells, without passing through a blocked cell. Return the fewest moves from the start to the target, or -1. Start with plain BFS, then explain how to avoid re-scanning the same cells on every jump.
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