Implement a Tic-Tac-Toe game API

Problem

Design and implement a Tic-Tac-Toe game class that supports playing moves on an n x n board.

Requirements

• Two players, represented by integers 1 and 2 .
• Method move(row, col, player) places the player's mark at (row, col) .
• After each move, return:
  • 0 if there is no winner yet,
  • 1 if player 1 wins,
  • 2 if player 2 wins.

Rules

• A player wins if they fill an entire row, column, or either diagonal.
• Moves are guaranteed to be valid (no repeats, within bounds).

Constraints / Follow-ups

• Aim for O(1) time per move (not O(n^2) scanning).
• Use O(n) additional memory if possible.

Example

For n = 3:

• move(0,0,1) -> 0
• move(0,2,2) -> 0
• move(2,2,1) -> 0
• move(1,1,2) -> 0
• move(2,0,1) -> 0
• move(1,0,2) -> 0
• move(2,1,1) -> 1 (player 1 completes bottom row)