Leetcode 3205. Maximum Array Hopping Score I

Given an integer array, compute the maximum score obtainable by starting at index 0 and repeatedly hopping forward under a constraint (e.g., a maximum jump distance), where your score is the sum of visited elements; this reduces to DP with dp[i] = arr[i] + max(dp[j]) over reachable j and is typically solved with a sliding-window maximum structure (monotonic deque or max-heap) for efficiency.