Tic Tac Toe is played on a $3 imes 3$ grid with two players, A and B. Player A always moves first and places an 'X' mark, while player B moves second and places an 'O' mark.

Players take turns placing their respective characters into any empty square on the board. The game concludes when a player places $3$ of their marks in a row, column, or diagonal, resulting in a win for that player. If all $9$ squares are filled and no player has achieved $3$ marks in a line, the game ends in a draw. If empty squares remain and no player has won, the game is still ongoing.

Given a $2 ext{D}$ integer array moves where moves[i] = [row_i, col_i] indicates that the $i^{ ext{th}}$ move was made at grid position (row_i, col_i), return:

• "A" if player A wins the game.

• "B" if player B wins the game.

• "Draw" if the game ends in a draw.

• "Pending" if the game is still in progress.

Constraints:

• $1 \leq$ moves.length $\leq 9$

• moves[i].length $= 2$

• $0 \leq$ row_i, col_i $\leq 2$

• There are no repeated elements on moves.

• moves follow the rules of tic tac toe.

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.