Available question text
Find the minimum cost to go from the top-left to bottom-right of an m×n grid where right/down moves cost the destination cell value and you may up to k times teleport for free to any cell with value ≤ your current cell. The key challenge is handling many zero-cost teleport edges by encoding remaining teleports in the state (k up to 10, m,n ≤ 80) and computing shortest paths/DP over that expanded state space.
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 3651. Minimum Cost Path with Teleportations
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source