← Questions
Max profit when taking a value skips ahead
0
I was asked this
No reports yet. Sign in to say where you were asked it.
You walk an array of positive integers from index 0. At index i you either take arr[i] and jump to index i + 1 + arr[i], or skip it and move to i + 1. Return the largest total you can collect. Solve it with DP from the right end.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding