You are given a $2 D$ integer matrix grid of size $n \times m$. You need to determine whether all cells in the matrix satisfy the following conditions:

• Every cell is equal to the cell directly below it, such that grid[i][j] == grid[i + 1][j] for all valid indices.

• Every cell is different from the cell directly to its right, such that grid[i][j] != grid[i][j + 1] for all valid indices.

Return true if all cells satisfy these conditions, or false otherwise.

Constraints:

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

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

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.