Maximum Array Hopping Score I
A medium-tier problem at 78% community acceptance, tagged with Array, Dynamic Programming, Stack. Reported in interviews at Zluri and 0 others.
Maximum Array Hopping Score I is a medium-difficulty problem that appears in Zluri interviews and sits at a 77% acceptance rate, which means it's not some obscure edge case but a real screening question. The trap here is thinking this is straightforward iteration when the optimal solution requires understanding dynamic programming or greedy selection. You need to recognize that a naive left-to-right pass leaves points on the table, and the pattern of when to jump and when to accumulate score isn't obvious without the right lens. If this problem hits your live assessment and you blank on the jump pattern, StealthCoder solves it in seconds invisible to the proctor.
Companies that ask "Maximum Array Hopping Score I"
Maximum Array Hopping Score I is the kind of problem that decides whether you pass. StealthCoder reads the problem on screen and surfaces a working solution in under 2 seconds. Invisible to screen share. The proctor sees nothing. Made for the engineer who has done the work but might still blank with a webcam pointed at him.
Get StealthCoderThe core trick is recognizing that you can't just greedily maximize every local decision. You're hopping through an array and collecting scores, but the sequence of jumps you choose determines your total. This is where dynamic programming shines: you need to track the maximum score achievable at each position, considering which previous positions you could have jumped from and what score you'd carry forward. The monotonic stack approach optimizes lookback to avoid quadratic time. Common failure point is assuming the best score comes from always jumping to the highest value or always jumping the furthest. Instead, you need to explore what the optimal substructure looks like: the best score ending at position i depends on the best scores at all positions you could have come from, plus your current value. StealthCoder handles this state transition correctly and surfaces a working solution so you move forward without rederiving the DP table under time pressure.
Pattern tags
You know the problem.
Make sure you actually pass it.
Maximum Array Hopping Score I recycles across companies for a reason. It's medium-tier, and most candidates blank under the timer. StealthCoder is the hedge: an AI overlay invisible during screen share. It reads the problem and surfaces a working solution in under 2 seconds. Made for the engineer who has done the work but might still blank with a webcam pointed at him. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Maximum Array Hopping Score I interview FAQ
Is this actually asked at real companies, or just LeetCode?+
Zluri has reportedly asked it. The 77% acceptance rate suggests it's not a rare edge case but a genuine screening problem. It's not FAANG-ubiquitous, but if you're interviewing at companies known for dynamic programming screens, this is exactly the kind of problem to prepare for.
What's the trick I'm missing if a greedy approach doesn't work?+
Greedy fails because jumping to the highest immediate score or furthest distance isn't optimal globally. The trick is dynamic programming: you need to compute the maximum score reachable at each position by considering all valid previous positions and the score you'd carry forward. Monotonic stack optimizes this.
How does this relate to other DP and stack problems?+
It combines DP (tracking optimal scores at each state) with monotonic stack (efficient range queries on previous positions). If you've done Next Greater Element or largest rectangle in histogram, the stack structure will feel familiar. The DP part is standard: recurrence based on subproblems.
What does 'hopping score' mean, and what are the jump rules?+
You hop through positions in an array, accumulating scores from each position you land on. Jump rules usually depend on array values or indices, but you need to read the problem carefully. The key is figuring out which previous positions are valid sources for your next jump.
Is 77% acceptance rate high? Will I likely get this right?+
77% is solid but not trivial. It means most people who've seen the pattern pass, but you can still fail if you miss the DP structure or implement a suboptimal O(n^2) solution under time pressure. That's where a working reference helps.
Want the actual problem statement? View "Maximum Array Hopping Score I" on LeetCode →