Frog Jump
A frog is crossing a river. The river is divided into some number of units, and at each unit, there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water. Given a list of stones positions in sorted ascending order, determine if the frog can cross the river by landing on the last stone. Initially, the frog is on the first stone and assumes the first jump must be 1 unit.

30:00

Frog Jump
hard
Topics
Companies

A frog is crossing a river. The river is divided into some number of units, and at each unit, there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water. Given a list of stones positions in sorted ascending order, determine if the frog can cross the river by landing on the last stone. Initially, the frog is on the first stone and assumes the first jump must be 1 unit.

Example 1:
Input: {"stones":[0,1,3,5,6,8,12,17]}
Output: true
Constraints:

  • 2≤stones.length≤20002 \leq \text{stones.length} \leq 2000

  • 0≤stones[i]≤231−10 \leq \text{stones}[i] \leq 2^{31} - 1

  • stones[0]==0\text{stones}[0] == 0

  • stones is sorted in a strictly increasing order.

Input
arr ={"stones":[0,1,3,5,6,8,12,17]}

Stones: [0, 1, 3, 5, 6, 8, 12, 17]

State
stones
[0, 1, 3, 5, 6, 8, 12, 17]
n
8
Variables
No variables to display
DepthFunction Call
Stack empty
0/1