Skip to contentSkip to footer

Software Senior Interview Questions

Salaries
Interviews

75,661 software senior interview questions shared by candidates

The 2-player game of Drawdown is played with N groups of stones. There is a group of stones belonging to player 1 at index 0, a group of stones belonging to player 2 at index N - 1, and groups of stones at indices [1..N-2] that have no specific owner. At the start of each game, a set of size k containing all valid moves is presented. Moves can be reused. Each move is represented by an array of N integers, with each integer representing the number of stones at the corresponding position the move adds or removes from the collection. All moves are guaranteed to reduce the total number of stones, even though they may increase the number of stones within an individual group. After no more moves can be completed (i.e. there are not enough of the required types of stones to remove to complete any move), the player with the greater number of their own stones remaining is declared the victor. If both players have the same number of stones, then player 2 wins to compensate for the disadvantage of going second. Example: Let's say the game begins with a board of [6, 4, 2, 4]. These are the available moves provided: [-2, -2, 1, 0] [-4, -4, 0 ,0] [0, 0, -2, -2] Initial board: [6, 4, 2, 4] Player 1 performs move 1. New board: [4, 2, 3, 4] Player 2 can either perform move 1 or move 3. They decide to perform move 1. New board: [2, 0, 4, 4] Player 1 performs move 3 (which is the only move available). New board: [2, 0, 2, 2] Player 2 is now forced to perform move 3. New board: [2, 0, 0, 0] The game is now over and player 1 is the winner.
avatar

Senior Software Engineer

Interviewed at Block

3.3★
May 5, 2019

The 2-player game of Drawdown is played with N groups of stones. There is a group of stones belonging to player 1 at index 0, a group of stones belonging to player 2 at index N - 1, and groups of stones at indices [1..N-2] that have no specific owner. At the start of each game, a set of size k containing all valid moves is presented. Moves can be reused. Each move is represented by an array of N integers, with each integer representing the number of stones at the corresponding position the move adds or removes from the collection. All moves are guaranteed to reduce the total number of stones, even though they may increase the number of stones within an individual group. After no more moves can be completed (i.e. there are not enough of the required types of stones to remove to complete any move), the player with the greater number of their own stones remaining is declared the victor. If both players have the same number of stones, then player 2 wins to compensate for the disadvantage of going second. Example: Let's say the game begins with a board of [6, 4, 2, 4]. These are the available moves provided: [-2, -2, 1, 0] [-4, -4, 0 ,0] [0, 0, -2, -2] Initial board: [6, 4, 2, 4] Player 1 performs move 1. New board: [4, 2, 3, 4] Player 2 can either perform move 1 or move 3. They decide to perform move 1. New board: [2, 0, 4, 4] Player 1 performs move 3 (which is the only move available). New board: [2, 0, 2, 2] Player 2 is now forced to perform move 3. New board: [2, 0, 0, 0] The game is now over and player 1 is the winner.

Viewing 1581 - 1590 interview questions

Glassdoor has 75,661 interview questions and reports from Software senior interviews. Prepare for your interview. Get hired. Love your job.