## Problem Two players take turns placing tiles on an `n x n` board. Player 1 uses `'X'`, Player 2 uses `'O'`. A player "wins" the moment they complete a full row, full column, or either diagonal. Given a sequence of moves `[(row, col), ...]` (alternating players, starting with Player 1), return the winner (1 or 2) and the move number at which they won, or `(-1, -1)` if the game ends without a winner. ```python def find_winner( n: int, moves: list[tuple[int, int]] ) -> tuple[int, int]: ``` ## Example ``` n=3, moves=[(0,0),(1,1),(0,1),(2,2),(0,2)] # Player 1 fills row 0 on move 5 Output: (1, 5) ``` ## Follow-ups 1. How do you track win conditions efficiently without rescanning the entire board each move? 2. What is the minimum number of moves needed for any win to be possible? 3. Extend to support `k`-in-a-row win condition on an `n x n` board where `k <= n`. 4. How would you handle a multi-player version with `p` players?

InterviewDB Question

Winning Tile - Find the Last Player to Complete a Row in a Tile Game

phone

Question Details

Problem Two players take turns placing tiles on an n x n board. Player 1 uses 'X', Player 2 uses 'O'. A player "wins" the moment they complete a full row, full column, or either diagonal. Given a sequence of moves [(row, col), ...] (alternating playe…

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Coding Onsite Phone

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview

← All Google questions Google Software Engineer Questions → All Greedy Questions →