You are given an m $ imes$ n integer matrix mat and an integer target.

Choose $1$ element from each row of mat such that the absolute difference between the sum of the chosen elements and target is minimized.

Return the minimum absolute difference.

Constraints:

• m == mat.length

• n == mat[i].length

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

• $1 \leq$ mat[i][j] $\leq 70$

• $1 \leq$ target $\leq 800$

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.