Implement Conway's Game of Life | Dataford Interview Questions

Build Conway's Game of Life.

Implement game_of_life(board, steps), where board is a rectangular 2D list containing 0 for dead cells and 1 for live cells. Return the board after exactly steps generations, applying the standard eight-neighbor rules simultaneously.

Constraints

0 <= board.length <= 50
If board is non-empty, every row has the same length
0 <= board[i].length <= 50
Each cell is either 0 or 1
0 <= steps <= 100

Function Signature

def game_of_life(board, steps):

Your question is Implement Conway's Game of Life. 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

Build Conway's Game of Life.

Constraints

0 <= board.length <= 50
If board is non-empty, every row has the same length
0 <= board[i].length <= 50
Each cell is either 0 or 1
0 <= steps <= 100

Function Signature

def game_of_life(board, steps):

Your question is Implement Conway's Game of Life. 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.