Minimum path sum

Challenge

Implement:

int min_path_sum(const int *grid, int rows, int cols);

Return the minimum sum of a path from top-left to bottom-right of a rows x cols grid (row-major, non-negative), moving only right or down.

Input format

Row-major grid, dimensions.

Output format

Minimum path sum.

Constraints

First row/column accumulate left-to-right / top-to-bottom.

Starter code

#include <stddef.h>
/* Minimum sum of a path (right/down only) from top-left to bottom-right of a rows x cols grid (row-major, non-negative). */
int min_path_sum(const int *grid,int rows,int cols){ (void)grid;(void)rows;(void)cols; return 0; }

Common mistakes

Mixing up row-major indexing (grid[i*cols+j]).

Edge cases to handle

1x1 grid -> its single cell.

Background lessons

• Grid DP