Given an $n imes n$ integer matrix grid, return the minimum sum of a falling path with non zero shifts.

A falling path with non zero shifts is a selection of exactly one element from each row of grid such that no two elements chosen in adjacent rows share the same column.

Constraints:

• n $==$ grid.length $==$ grid[i].length

• $1 \leq$ n $\leq 200$

• $-99 \leq$ grid[i][j] $\leq 99$

Now, 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.