Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Jump Game VII
Bookmark
Brute Force
Farthest Pointer
Prefix Sum
Input
Example 1
Example 2
Min case
All zeros
Long block
Custom
s
=
011010
,
minJump
=
2
,
maxJump
=
3
s
visited
0
0
1
1
2
1
3
0
4
1
5
0
F
F
F
F
F
F
s
visited
0
0
1
1
2
1
3
0
4
1
5
0
F
F
F
F
F
F
s
visited
0
0
1
1
2
1
3
0
4
1
5
0
T
F
F
F
F
F
queue = [0]
s
visited
0
0
1
1
2
1
3
0
4
1
5
0
T
F
F
F
F
F
i
queue = []
s
visited
range [2..3]
0
0
1
1
2
1
3
0
4
1
5
0
T
F
F
F
F
F
i
j
queue = []
s
visited
range [2..3]
0
0
1
1
2
1
3
0
4
1
5
0
T
F
F
F
F
F
i
j
queue = []
s
visited
range [2..3]
0
0
1
1
2
1
3
0
4
1
5
0
T
F
F
T
F
F
i
j
queue = [3]
s
visited
0
0
1
1
2
1
3
0
4
1
5
0
T
F
F
T
F
F
i
queue = []
s
visited
range [5..5]
0
0
1
1
2
1
3
0
4
1
5
0
T
F
F
T
F
F
i
j
queue = []
s
visited
range [5..5]
0
0
1
1
2
1
3
0
4
1
5
0
T
F
F
T
F
T
i
j
queue = []
s
visited
0
0
1
1
2
1
3
0
4
1
5
0
T
F
F
T
F
T
Result: true
algo
master
.
io
Step:
Start: Determine if we can reach index n-1 from index 0
0 / 9
Input
Example 1
Example 2
Min case
All zeros
Long block
Custom
s
=
011010
,
minJump
=
2
,
maxJump
=
3
0 / 9
algo
master
.
io
Step:
Start: Determine if we can reach index n-1 from index 0
