Minimum Path Sum with Obstacles

Now each cell holds a value and you want the cheapest route to the corner. The goal shifts from counting paths to minimizing a cost.

Let dp[i][j] be the smallest total cost to reach cell (i, j). Same grid, same moves, but we track sums instead of counts.