← Adobe questions

Minimum Jumps

Filed under Adobe · Also reported at Flipkart, McKinsey

Given an array of non-negative integers where each element represents your maximum jump length at that position, find the minimum number of jumps to reach the last index starting from the first index.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Adobe questions

Collected from public candidate posts and coding forums. Updated Nov 2026.