Minimum jumps across stones with k-1, k, k+1 jump lengths
Filed under AppDynamics
The question
On a number line 0..N (N up to 1e9) with up to 1e5 stones at 0, 1 and N and others, the first jump is length 1 and each next jump is k-1, k or k+1 of the previous length; find the minimum jumps from 0 to N, or -1 if impossible. Code and dry run expected.
No write-up yet. Related questions below have one.
Related AppDynamics questions
Collected from public candidate posts and coding forums. Updated Nov 2026.