Leetcode 3221. Maximum Array Hopping Score II

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.