You are given an m × n grid containing non-negative integers. Your task is to find a path from the top-left cell to the bottom-right cell that minimizes the sum of the values along the path. At each step, you may move only right or down.

Constraints:

• m == grid.length

• n == grid[i].length

• $1 \leq$m, n $\leq 200$

• $0 \leq$ grid[i][j] $\leq 200$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.