Available question text
Given nums and target, you may jump from i to any j>i if nums[j]-nums[i] lies in [-target, target]; compute the maximum number of jumps to reach index n-1 (or -1 if unreachable). This is the longest-path problem on an index-ordered DAG (edges only go to higher indices), solvable with DP given n ≤ 1000.
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 2770. Maximum Number of Jumps to Reach the Last Index
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source