Tic Tac Toe - Amazon Top Interview Questions


Problem Statement :


Implement the tic-tac-toe game with the following methods:

TicTacToe(int n) which instantiates an n x n game board. A player wins a game if their pieces either form a horizontal, vertical, or diagonal line of length n.
int move(int r, int c, boolean me) which places the next move at row r and column c. me indicates whether it's my move (me = true) or it's your opponent's (me = false) move. If this move makes you win, return 1, if your opponent wins, return -1, and otherwise return 0.
Constraints

1 ≤ n ≤ 100,000

0 ≤ m ≤ 100,000 where m is the number of calls to move

Example 1

Input

methods = ["constructor", "move", "move", "move", "move", "move"]

arguments = [[3], [0, 0, True], [2, 0, False], [0, 1, True], [2, 1, False], [0, 2, True]]`

Output

[None, 0, 0, 0, 0, 1]

Explanation

t = TicTacToe(3)

t.move(0, 0, True) == 0 # I place piece (0, 0)

t.move(2, 0, False) == 0 # Opponent places piece (2, 0)

t.move(0, 1, True) == 0 # I place piece (0, 1)

t.move(2, 1, False) == 0 # Opponent places piece (2, 1)

t.move(0, 2, True) == 1 # I place piece (0, 2) to win


Solution :



title-img 




                        Solution in C++ :

class TicTacToe {
    int n;
    unordered_map<int, int> row[2], col[2], diag[2], cross[2];

    public:
    TicTacToe(int n) : n(n) {
    }

    int move(int r, int c, bool me) {
        int winner = 2 * me - 1;
        if (++row[me][r] == n) return winner;
        if (++col[me][c] == n) return winner;
        if (++diag[me][r + c] == n) return winner;
        if (++cross[me][r - c] == n) return winner;
        return 0;
    }
};
                    


                        Solution in Java :

import java.util.*;

class TicTacToe {
    int n;
    int[] rowSum;
    int[] colSum;
    int diag;
    int revDiag;

    public TicTacToe(int n) {
        this.n = n;
        rowSum = new int[n];
        colSum = new int[n];
        diag = 0;
        revDiag = 0;
    }

    public int move(int r, int c, boolean me) {
        // Step 1) Make a move
        int val = me ? 1 : -1;
        rowSum[r] += val;
        colSum[c] += val;

        if (r == c)
            diag += val;
        if (r == n - c - 1)
            revDiag += val;

        // Step 2) Check if game over
        boolean gameOver = Math.abs(rowSum[r]) == n || Math.abs(colSum[c]) == n
            || Math.abs(diag) == n || Math.abs(revDiag) == n;

        if (gameOver)
            return me ? 1 : -1;
        return 0;
    }
}
                    


                        Solution in Python : 
                            
class TicTacToe:
    def __init__(self, n):
        self.n = n
        self.row_sums = [0] * n
        self.col_sums = [0] * n
        self.diag = self.inv_diag = 0

    def move(self, r, c, me):
        val = 1 if me else -1

        # update values
        self.row_sums[r] += val
        self.col_sums[c] += val
        if r == c:
            self.diag += val
        if r == self.n - c - 1:
            self.inv_diag += val

        # check wins
        if self.n in list(map(abs, [self.row_sums[r], self.col_sums[c], self.diag, self.inv_diag])):
            return val
        return 0


View More Similar Problems

Simple Text Editor

In this challenge, you must implement a simple text editor. Initially, your editor contains an empty string, S. You must perform Q operations of the following 4 types: 1. append(W) - Append W string to the end of S. 2 . delete( k ) - Delete the last k characters of S. 3 .print( k ) - Print the kth character of S. 4 . undo( ) - Undo the last (not previously undone) operation of type 1 or 2,

View Solution →

Poisonous Plants

There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plan

View Solution →

AND xor OR

Given an array of distinct elements. Let and be the smallest and the next smallest element in the interval where . . where , are the bitwise operators , and respectively. Your task is to find the maximum possible value of . Input Format First line contains integer N. Second line contains N integers, representing elements of the array A[] . Output Format Print the value

View Solution →

Waiter

You are a waiter at a party. There is a pile of numbered plates. Create an empty answers array. At each iteration, i, remove each plate from the top of the stack in order. Determine if the number on the plate is evenly divisible ith the prime number. If it is, stack it in pile Bi. Otherwise, stack it in stack Ai. Store the values Bi in from top to bottom in answers. In the next iteration, do the

View Solution →

Queue using Two Stacks

A queue is an abstract data type that maintains the order in which elements were added to it, allowing the oldest elements to be removed from the front and new elements to be added to the rear. This is called a First-In-First-Out (FIFO) data structure because the first element added to the queue (i.e., the one that has been waiting the longest) is always the first one to be removed. A basic que

View Solution →

Castle on the Grid

You are given a square grid with some cells open (.) and some blocked (X). Your playing piece can move along any row or column until it reaches the edge of the grid or a blocked cell. Given a grid, a start and a goal, determine the minmum number of moves to get to the goal. Function Description Complete the minimumMoves function in the editor. minimumMoves has the following parameter(s):

View Solution →