You are given an $m \times n$ integer matrix grid, and three integers row, col, and color. Each value in grid represents the color of the square at that coordinate.

Two squares belong to the same connected component if they share the same color and are adjacent to each other in one of the four cardinal directions.

The border of a connected component is defined as all squares in that component that are situated on the boundary of the grid or are adjacent to at least one square that does not belong to the component.

Color the border of the connected component that contains the square grid[row][col] with color.

Return the modified grid.

Constraints:

• m == grid.length

• n == grid[i].length

• $1 \le$ m, n $\le 50$

• $1 \le$ grid[i][j], color $\le 1000$

• $0 \le$ row $< m$

• $0 \le$ col $< n$

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.