Jump Game VI

MediumDynamic Programmingmonotonic stack

Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.

Practice this as a mock interviewFree to start, no account needed

Problem

You start at index 0 of the integer array nums and want to reach the last index. From index i you may jump forward to any index in [i + 1, min(n - 1, i + k)]. Your score is the sum of nums[j] over every index j you land on, including index 0 and the last index. Values may be negative. Return the maximum score achievable. Aim for O(n) time using a sliding-window maximum.

Examples

Input: nums = [1,-1,-2,4,-7,3], k = 2
Output: 7
Visit indices 0, 1, 3, 5: 1 - 1 + 4 + 3 = 7.
Input: nums = [10,-5,-2,4,0,3], k = 3
Output: 17
Visit indices 0, 3, 5: 10 + 4 + 3 = 17.
Input: nums = [1,-5,-20,4,-1,3,-6,-3], k = 2
Output: 0
The best route is 0, 1, 3, 5, 7: 1 - 5 + 4 + 3 - 3 = 0.

Constraints

  • 1 <= nums.length, k <= 10^5
  • -10^4 <= nums[i] <= 10^4

What the interviewer grades

A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.

More monotonic stack problems