Question
Given an m x n board of 0s (dead) and 1s (live), compute the next state under Conway's Game of Life and return it as a new board. Each cell's eight neighbors determine its fate: a live cell survives with 2 or 3 live neighbors (else dies); a dead cell becomes live with exactly 3 live neighbors. Cells outside the board are treated as dead. The board has at least one cell.
game_of_life(board: list[list[int]]) → list[list[int]][[[0,1,0],[0,0,1],[1,1,1],[0,0,0]]]out[[0,0,0],[1,0,1],[0,1,1],[0,1,0]]State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.