Solving Find Winner on a Tic Tac Toe Game in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

## Problem Description

Here are the rules of Tic-Tac-Toe:

• Players take turns placing characters into empty squares (" ").
• "X" and "O" characters are always placed into empty squares, never on filled ones.
• The game ends when there are 3 of the same (non-empty) character filling any row, column, or diagonal.
• The game also ends if all squares are non-empty.
• No more moves can be played if the game is over.

Example 1:

``````Input: moves = [[0,0],[2,0],[1,1],[2,1],[2,2]]
Output: "A"
Explanation: "A" wins, he always plays first.
"X  "    "X  "    "X  "    "X  "    "X  "
"   " -> "   " -> " X " -> " X " -> " X "
"   "    "O  "    "O  "    "OO "    "OOX"
``````

Example 2:

``````Input: moves = [[0,0],[1,1],[0,1],[0,2],[1,0],[2,0]]
Output: "B"
Explanation: "B" wins.
"X  "    "X  "    "XX "    "XXO"    "XXO"    "XXO"
"   " -> " O " -> " O " -> " O " -> "XO " -> "XO "
"   "    "   "    "   "    "   "    "   "    "O  "
``````

Example 3:

``````Input: moves = [[0,0],[1,1],[2,0],[1,0],[1,2],[2,1],[0,1],[0,2],[2,2]]
Output: "Draw"
Explanation: The game ends in a draw since there are no moves to make.
"XXO"
"OOX"
"XOX"
``````

Example 4:

``````Input: moves = [[0,0],[1,1]]
Output: "Pending"
Explanation: The game has not finished yet.
"X  "
" O "
"   "
``````

Constraints:

• `1 <= moves.length <= 9`

• `moves[i].length == 2`

• `0 <= moves[i][j] <= 2`

• 1 <= moves.length <= 9

• moves[i].length == 2

• 0 <= moves[i][j] <= 2

See the full details of the problem Find Winner on a Tic Tac Toe Game at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go