N x N Tic Tac Toe Win Logic | Dataford Interview Questions

NxN tic tac toe with wincount given, if no of consecutive Os or Xs in a line equals "wincount" then the player wins. Write the win condition logic.

Asked in the pair programming stage.

Implement check_winner(board, win_count). board is an NxN list of lists containing "X", "O", or " ". Return the winning symbol, or None if neither player has a winning line. A run longer than win_count also qualifies because it contains a consecutive segment of that length. Check horizontal, vertical, and both diagonal directions.

Constraints

1 <= len(board) <= 500
board is square, and every row has len(board) cells
Each cell is one of "X", "O", or " "
1 <= win_count <= len(board)
A valid board contains at most one winning player

Function Signature

def check_winner(board, win_count):

Your question is N x N Tic Tac Toe Win Logic. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

NxN tic tac toe with wincount given, if no of consecutive Os or Xs in a line equals "wincount" then the player wins. Write the win condition logic.

Asked in the pair programming stage.

Constraints

1 <= len(board) <= 500
board is square, and every row has len(board) cells
Each cell is one of "X", "O", or " "
1 <= win_count <= len(board)
A valid board contains at most one winning player

Function Signature

def check_winner(board, win_count):

Your question is N x N Tic Tac Toe Win Logic. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.