Question
Implement one step of Conway's Game of Life on an m x n board of 0s and 1s, updating the board IN PLACE (you may not allocate a second full board) and return the updated board. Rules: a live cell with 2 or 3 live neighbors survives; a dead cell with exactly 3 live neighbors becomes live; all others die or stay dead. Neighbors are the 8 surrounding cells. The board may be up to 100 x 100.
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.