solulubeta
Sign in
Story Problems / Dynamic programming
07.08 · Problem

Frog Minimum Jumps

Medium 1-D DP · min steps Pro

This problem is part of solulu Pro

A frog stands on stone 0. Stone i lets it jump any distance from 1 up to reach[i] stones forward. The last stone is always reachable. What is the minimum number of jumps needed to land on the last stone?

Lifetime ₹2,000 ₹1,000 · Beta offer
Mark this problem as solved when you are finished.

Item 82 of 94 · updated 2026-10-12