Practice Jump Game VI
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Jump Game VI
Problem Statement
You are given a 0-indexed integer array nums and an integer k. You are initially standing at index 0. In one move, you can jump at most k steps forward without going outside the boundaries of the array. That is, you can jump from index i to any index in the range [i + 1, min(n - 1, i + k)] inclusive. You want to reach the last index of the array (index n - 1). Your score is the sum of all nums[j] for each index j you visited in the array. Return the maximum score you can get.
Source: Jump Game VI on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
nums = [1,-1,-2,4,-7,3], k = 2
7
# Example 2
nums = [10,-5,-2,4,0,3], k = 3
17
# Example 3
nums = [1,-5,-20,4,-1,3,-6,-3], k = 2
0
Constraints
Related LeetCode Problems
Practice more problems similar to Jump Game VI.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.