FastPrepMinimum Cost Path with Teleportations

Minimum Cost Path with Teleportations

Amazon logoAmazon● HardNEW GRADOA

Problem statement

Find the cheapest route across an integer matrix grid, from (0, 0) to (m - 1, n - 1). The starting cost is 0.

You can combine these moves:

The problem statement continues
Pro

Examples

Example 1

grid = [[1,3,3],[2,5,4],[4,3,5]]k = 2return = 7

Take (0,0) → (1,0) → (1,1), paying 2 + 5 = 7. Both (1,1) and the goal contain 5, so one free teleport finishes the route.

FastPrep Pro
Reported in 1 Amazon interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

  • Full problem statement and constraints
  • 1 more worked example, explained
  • Guided hints and editorial
  • Run your code on real test cases
$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week
See Amazon hiring insights
CodePython 3
Run and Submit unlock with Pro
FastPrep Pro
Reported in 1 Amazon interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

  • Full problem statement and constraints
  • 1 more worked example, explained
  • Guided hints and editorial
  • Run your code on real test cases
$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week