Fewest jumps between two indices of a circular array

0
Remix

In a circular array, arr[i] is the exact distance you may jump from index i, either left or right, wrapping around the ends. Given a start index and a target index, return the fewest jumps from one to the other, or -1.

UberTechnical phone screenLast asked Jan 2026
No answer yet. Write the first one; the best answer gets endorsed.