You are given an m $ imes$ n binary grid grid. You start at the top left cell $(0, 0)$ and wish to reach the bottom right cell $(m - 1, n - 1)$. From any cell, you may only move either right or down.

Return true if there is a path from $(0, 0)$ to $(m - 1, n - 1)$ that visits an equal number of $0$’s and $1$’s, or false otherwise.

Constraints:

• m $==$ grid.length

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

• $2 \leq$ m, n $\leq 100$

• grid[i][j] is either $0$ or $1$.

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.