CodingReported in a candidate post, Jul 2025
Maximum sum path with jumps
Filed under Rippling
The question
Given an array and a jump limit k, find the maximum sum path from index 0 to n-1 where you can jump to any index between i+1 and i+k.
No write-up yet. Related questions below have one.
Related Rippling questions
Collected from public candidate posts and coding forums. Updated Nov 2026.