Available question text
Given an array of coin costs (with some positions possibly blocked) and a maximum jump length B, find a sequence of jumps from the first to the last index that minimizes the total cost; if multiple sequences have equal cost return the lexicographically smallest index sequence, or empty if unreachable. This is essentially a shortest-path/DP on a directed acyclic graph with a lexicographic tie-breaker constraint.
Related questions
Continue with questions that share topics or the same question type.
- Alphabet Board Path
Coding · Hash Table · String
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- change directory via i.e. bash -> write a function given current directory and a new location return the new path
Coding
- Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
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
Oracle
Leetcode 656. Coin Path
Reported Sep 7, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source