Fewest Jumps to the End

Talk it through with a coach who asks guiding questions and gives hints until you reach the answer. Pass to mark the challenge as completed.

The problem

  • medium
  • Pro

You start at the first position of a list, and each number says the furthest you may jump forward from there. Assuming the end is always reachable, find the fewest jumps needed to get there.

Talk this problem through with an AI coach

This is a Pro challenge. Sign in with Google, then upgrade to start a voice session.

Start free →