You are given an m $\times$ n integer matrix grid.

Determine whether it is possible to make either a single horizontal cut or a single vertical cut to partition grid into two non empty rectangular sections such that the sum of the elements in both sections is equal.

Return true if such a partition is possible, or false otherwise.

Constraints:

• $1 \leq$ m $==$ grid.length $\leq 10^5$

• $1 \leq$ n $==$ grid[i].length $\leq 10^5$

• $2 \leq$ m $\times$ n $\leq 10^5$

• $1 \leq$ grid[i][j] $\leq 10^5$

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.