Valid Tic-Tac-Toe State
Given a Tic-Tac-Toe board as a string array board, return true if and only if it is possible to reach this board position during the course of a valid tic-tac-toe game.
Given a Tic-Tac-Toe board as a string array board, return true if and only if it is possible to reach this board position during the course of a valid tic-tac-toe game.
The board is a 3 x 3 array that consists of characters ' ', 'X', and 'O'. The ' ' character represents an empty square.
Here are the rules of Tic-Tac-Toe:
Example 1
Input: board = ["O "," "," "]
Output: false
Explanation: The first player always plays "X".
Example 2
Input: board = ["XOX"," X "," "]
Output: false
Explanation: Players take turns making moves.
Example 3
Input: board = ["XOX","O O","XOX"]
Output: true
Constraints
- board.length == 3
- board[i].length == 3
- board[i][j] is either 'X', 'O', or ' '.
Hints
No hints yet.
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.