Given an m $\times$ n integer matrix board representing a grid of candies, where each positive integer represents a distinct candy type and $0$ represents an empty space, simulate the process of the Candy Crush game according to the following rules:

1. Identify all groups of $3$ or more adjacent candies of the same type aligned horizontally or vertically.

2. Crush all identified candies simultaneously by changing their values to $0$.

3. Apply gravity so that the remaining candies in each column drop down to fill the empty spaces below them. Any empty spaces left at the top of the columns are filled with $0$.

4. Repeat steps $1$ through $3$ until no more candies can be crushed.

Return the final state of board after the grid reaches a stable configuration.

Constraints:

• m $==$ board.length

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

• $3 \leq$ m, n $\leq 50$

• $1 \leq$ board[i][j] $\leq 2000$

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.