You are given an $m \times n$ grid board consisting of characters 'X' and 'O'.

Capture all regions that are surrounded by 'X'.

A region is considered captured when every 'O' within it is replaced by 'X'. A region of 'O' cells is surrounded if it is completely enclosed by 'X' cells horizontally and vertically, such that no cell in the region connects to any boundary of board through horizontally or vertically adjacent 'O' cells.

Modify board in place.

Constraints:

• m $==$ board.length

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

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

• board[i][j] is 'X' or 'O'.

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.