Game of Life Implementation | Dataford Interview Questions

Implement an algorithm to solve the Game of Life.

Given a rectangular 2D integer array board, update it to its next state in place. A live cell is 1, and a dead cell is 0. Each cell has up to eight neighbors. A live cell survives with two or three live neighbors, a dead cell becomes live with exactly three live neighbors, and all other cells become or remain dead. The function should return nothing; the input board must contain the next state after the function completes.

Function signature: def game_of_life(board):

Constraints: 0 <= rows, cols <= 100, and every row has the same length.

Constraints

0 <= rows, cols <= 100
The board is rectangular, so every row has the same length
Each cell is initially either 0 or 1
The board must be modified in place
The function returns None

Function Signature

def game_of_life(board):

Your question is Game of Life Implementation. 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