Leetcode 2304. Minimum Path Cost in a Grid

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.