Minimum jumps to reach end with value-based teleportation
Filed under Global Analytics
The question
In an array, you can move to i+1, i-1, or any index k where arr[i] == arr[k]. Find the minimum number of jumps to reach the last index starting from the first.
No write-up yet. Related questions below have one.
Related Global Analytics questions
Collected from public candidate posts and coding forums. Updated Nov 2026.