Available question text
Given an array and rules for hopping between indices that collect the values you land on (typically with constraints like a limited hop range or restricted directions), find the maximum total score achievable. The core challenge is formulating a DP for the best score ending at each index and using a data structure (monotonic deque / heap / segment tree) to query previous optimal states efficiently.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3221. Maximum Array Hopping Score II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source