Jump Game: coding question

Problem

You get an array of non-negative integers nums. You start at index 0. The value nums[i] is the longest jump that you can make from index i.

From index i, you can move to any index from i + 1 to i + nums[i]. Return true if you can reach the last index. Otherwise, return false.

Input:: nums = [1,3,0,0,2]
Output:: true
Explanation:: Jump 1 step from index 0 to index 1. Then jump 3 steps from index 1 to the last index.

Input:: nums = [2,1,0,4]
Output:: false
Explanation:: Each path stops at index 2, because nums[2] is 0. You cannot reach index 3.

SysRound wrote this statement. A reference solution checks every example.

Continue with questions that share topics or the same question type.

Jump Game II
Coding · Array · Dynamic Programming · Greedy
Best Time to Buy and Sell Stock II
Coding · Array · Dynamic Programming · Greedy
Minimum Number of Refueling Stops
Coding · Array · Dynamic Programming · Greedy
Non-overlapping Intervals
Coding · Array · Dynamic Programming · Greedy

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

LeetCode company tags · 2 records

Problem

You get an array of non-negative integers nums. You start at index 0. The value nums[i] is the longest jump that you can make from index i.

From index i, you can move to any index from i + 1 to i + nums[i]. Return true if you can reach the last index. Otherwise, return false.

Input:: nums = [1,3,0,0,2]
Output:: true
Explanation:: Jump 1 step from index 0 to index 1. Then jump 3 steps from index 1 to the last index.

Input:: nums = [2,1,0,4]
Output:: false
Explanation:: Each path stops at index 2, because nums[2] is 0. You cannot reach index 3.

SysRound wrote this statement. A reference solution checks every example.