Available question text
Find the minimum number of jumps to reach the last index from index 0 in an array where from index i you may move to i±1 or to any other index j with the same value arr[j]; treat indices as graph nodes and compute the shortest path (n ≤ 5·10^4), taking care to handle potentially many equal-value edges efficiently.
Related questions
Continue with questions that share topics or the same question type.
- Jump Game
Coding · Array · Dynamic Programming · Greedy
- Jump Game II
Coding · Array · Dynamic Programming · Greedy
- Jump Game III
Coding
- Jump Game IX
Coding
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 1345. Jump Game IV
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source