Minimum Path Cost in a Grid: coding question

Available question text

Find the minimum-cost path from any cell in the first row to any cell in the last row of an m×n grid where you may move from a cell to any cell in the next row and the cost equals the sum of visited cell values plus moveCost[sourceValue][destCol]; effectively compute a shortest path on a layered DAG (or use row-by-row DP) taking into account the value-to-moveCost mapping.

Continue with questions that share topics or the same question type.

Minimum Cost to Make at Least One Valid Path in a Grid
Coding
Minimum Path Cost in a Hidden Grid
Coding
Minimum Cost Homecoming of a Robot in a Grid
Coding
Minimum Cost of a Path With Special Roads
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

Walmart
Leetcode 2304. Minimum Path Cost in a Grid
Reported Sep 23, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source

Minimum Path Cost in a Grid

Available question text

Related questions

Minimum Path Cost in a Grid

Available question text

Related questions