{"request":{"endpoint":"https://exercism.org/api/v2/tracks/python/exercises/game-of-life/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"5e80db2033bf4c88af24b1220b4e8544","snippet":"def tick(matrix): if len(matrix) == 0: return [] row_num = len(matrix) row_length = len(matrix[0]) result = [] for row_index in range(row_num): new_row = [] result.append(new_row) for index in range(row_length): ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":1,"num_loc":36,"iteration_status":"actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-07T02:40:31.000Z","is_out_of_date":false,"language":"python","author":{"handle":"salmon123"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/salmon123","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"5319a909821241e7af9fdbab2b431b00","snippet":"def tick(matrix): if not matrix: return [] rows = len(matrix) cols = len(matrix[0]) def count_live_neighbors(r, c): directions = [ (-1, -1), (-1, 0), (-1, 1), ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":28,"iteration_status":"actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-25T06:17:17.000Z","is_out_of_date":false,"language":"python","author":{"handle":"yugarajan1023"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/yugarajan1023","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"671797a029df4b81bb14702eff68bcee","snippet":"def tick(matrix): if len(matrix) == 0: return matrix ROWS, COLS = len(matrix), len(matrix[0]) def count_neighbors(r, c): neighbor = 0 for row in range(r - 1, r + 2): for column in range(c - 1, c + 2): if(row == r and column == c) or row < 0 or column < 0 or row == ROWS or column == COLS: ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-06T19:57:55.000Z","is_out_of_date":false,"language":"python","author":{"handle":"SandeepKumarKuanar"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/SandeepKumarKuanar","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"087553fc214f4ef4a5101c7266a88898","snippet":"def tick(matrix: list[list[int]]) -> list[list[int]]: if not matrix: return [] r, c = len(matrix), len(matrix[0]) cnt = [[0] * c for _ in matrix] for i, row in enumerate(matrix): for j, x in enumerate(row): for ii in range(max(i - 1, 0), min(i + 2, r)): for jj in range(max(j - 1, 0), min(j + 2, c)): if i == ii and j == jj: ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-01-27T23:56:43.000Z","is_out_of_date":false,"language":"python","author":{"handle":"falsetru"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/falsetru","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"4161ccb49b8b49cf822986b2e83a926d","snippet":"def tick(matrix): copy = [[0] * len(matrix) for _ in range(len(matrix))] for y, row in enumerate(matrix): for x in range(len(row)): live_neighbours = 0 if x > 0 and matrix[y][x - 1] == 1: live_neighbours += 1 if x < len(row) - 1 and matrix[y][x + 1] == 1: live_neighbours += 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-01-27T23:30:11.000Z","is_out_of_date":false,"language":"python","author":{"handle":"akmaekki7"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/akmaekki7","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"679377afafed43468cec1a1117201a71","snippet":"def tick(matrix): rows = len(matrix) cols = len(matrix[0]) if rows else 0 new_matrix = [[0] * cols for _ in range(rows)] for r in range(rows): for c in range(cols): live_neighbors = 0 ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-01-30T11:22:34.000Z","is_out_of_date":false,"language":"python","author":{"handle":"soufian0127"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/soufian0127","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"289a9f6af32a4c9c9b6b625e6ec3fca2","snippet":"def inbounds(r, c, rows, cols): return 0 <= r < rows and 0 <= c < cols def tick(matrix): dirs8 = ( (-1, 0), (1, 0), (0, -1), (0, 1), (-1, -1), (-1, 1), (1, -1), (1, 1) ) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":28,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-01T16:55:11.000Z","is_out_of_date":false,"language":"python","author":{"handle":"langston723"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/langston723","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"f3201c9cafad4fbf9bb3d79ad9222120","snippet":"def tick(matrix): if len(matrix) == 0: return matrix result = [row.copy() for row in matrix] size = len(matrix) for r in range(size): for c in range(size): neighbors = check(matrix, r, c) if matrix[r][c] == 0 and neighbors == 3: result[r][c] = 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":34,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-02T18:55:35.000Z","is_out_of_date":false,"language":"python","author":{"handle":"irvingbennett"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/irvingbennett","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"ed5f6623ade945a784a0f60d3978c680","snippet":"def tick(matrix): N = 0 NE = 0 E = 0 SE = 0 S = 0 SW = 0 W = 0 NW = 0 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":57,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-05T01:01:05.000Z","is_out_of_date":false,"language":"python","author":{"handle":"Xijin"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/Xijin","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"94ef2203a4814205b204d52f62c800e5","snippet":"def tick(matrix): if not matrix: return [] rows = len(matrix) cols = len(matrix[0]) new_grid = [[0 for _ in range(cols)] for _ in range(rows)] for r in range(rows): for c in range(cols): ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-07T08:11:11.000Z","is_out_of_date":false,"language":"python","author":{"handle":"taypyc"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/taypyc","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"fa1292d9dd3444cdaa07dca97673e267","snippet":"def tick(board): if not board or not board[0]: return [] rows, cols = len(board), len(board[0]) new_board = [[0]*cols for _ in range(rows)] for r in range(rows): for c in range(cols): live_neighbors = sum( ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-10T08:12:42.000Z","is_out_of_date":false,"language":"python","author":{"handle":"carlomansu"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/carlomansu","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"7ac090311b6d449aa80927f3d26b2b83","snippet":"def tick(matrix): def cell(r, c): nbc = 0 for dr, dc in ((-1,0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)): tr = r + dr tc = c + dc if 0 <= tr < nr and 0 <= tc < nc and matrix[tr][tc] == 1: nbc += 1 return 1 if (matrix[r][c] == 1 and nbc in (2, 3)) or (matrix[r][c] == 0 and nbc == 3) else 0 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-17T14:58:21.000Z","is_out_of_date":false,"language":"python","author":{"handle":"basilschegolkov"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/basilschegolkov","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"aaea16f0855c4f56af2158bf9f906cf2","snippet":"def tick(matrix): new_matrix = [] for r in range(len(matrix)): new_row = [] for c in range(len(matrix[r])): new_row.append(tick_cell(matrix, r, c)) new_matrix.append(new_row) return new_matrix def tick_cell(matrix, row, col): ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-19T17:21:32.000Z","is_out_of_date":false,"language":"python","author":{"handle":"npadgen"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/npadgen","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"788657f82cdd4135a2adb2233793da73","snippet":"def tick(matrix): NEW_matrix = copy.deepcopy(matrix) alive=False directions = [ (-1,-1),(0, -1), (1,-1), (-1,1),(0, 1), (1, 1), (-1,0),(1, 0) ] for y,i in enumerate(matrix): for x,j in enumerate(i): ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":27,"iteration_status":"essential_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-22T15:34:06.000Z","is_out_of_date":false,"language":"python","author":{"handle":"jadouu"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/jadouu","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"9b2203584d004ca080c449ea4079e2b4","snippet":"def neighbors(matrix, index): row_length = len(matrix) column_length = len(matrix[0]) row, column = index neighbors_cord = [ (row, column - 1), (row, column +1), (row - 1, column -1), (row - 1, column), (row - 1, column +1), (row + 1, column -1), (row + 1, column), (row + 1, column + 1) ] ones = 0 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":31,"iteration_status":"non_actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-22T16:16:15.000Z","is_out_of_date":false,"language":"python","author":{"handle":"python0data0scientist"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/python0data0scientist","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"03f0475dd6544f6f8173f2e212fa62b0","snippet":"def tick(matrix): if not matrix or not matrix[0]: return [] rows = len(matrix) cols = len(matrix[0]) directions = [ (-1,-1), (-1,0), (-1,1), (0,-1), (0,1), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":26,"iteration_status":"actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-24T14:11:28.000Z","is_out_of_date":false,"language":"python","author":{"handle":"vignesh2325"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/vignesh2325","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"def0b5467663452898ded6910d508e27","snippet":"DIRECTIONS = ( (-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1), ) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":49,"iteration_status":"non_actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-27T02:19:58.000Z","is_out_of_date":false,"language":"python","author":{"handle":"RareBird15"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/RareBird15","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"ef9f9085aa8445eba5b9496e2c847888","snippet":"def tick(matrix): if matrix == []: return [] n_row, n_col = len(matrix),len(matrix[0]) result = [[0]*n_col for _ in range(n_row)] for x in range(n_row): for y in range(n_col): n_live = 0 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":14,"iteration_status":"actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-04T18:10:44.000Z","is_out_of_date":false,"language":"python","author":{"handle":"crystal220"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/crystal220","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"9ac2e57558fb4c0fbb40082cdf20163e","snippet":"def tick(board): if not board: return [] rows = len(board) cols = len(board[0]) def count_live_neighbors(r, c): directions = [ (-1, -1), (-1, 0), (-1, 1), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":28,"iteration_status":"actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-26T04:13:21.000Z","is_out_of_date":false,"language":"python","author":{"handle":"Pooja-VR"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/Pooja-VR","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"a98ee7f3e96049649fe5f5f656f2634d","snippet":"def tick(matrix): rows = len(matrix) cols = len(matrix[0]) if rows > 0 else 0 def count_live_neighbors(r, c): directions = [ (-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1) ] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":26,"iteration_status":"actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-30T10:30:00.000Z","is_out_of_date":false,"language":"python","author":{"handle":"sudharshanarajawork-lab"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/sudharshanarajawork-lab","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"18c0ab3064f34f55a2118198aea1292a","snippet":"def tick(matrix): if not matrix: return [] rows = len(matrix) cols = len(matrix[0]) if rows else 0 new_matrix = [[0] * cols for _ in range(rows)] for r in range(rows): for c in range(cols): ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":21,"iteration_status":"actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-19T03:19:54.000Z","is_out_of_date":false,"language":"python","author":{"handle":"stevenhiltrop"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/stevenhiltrop","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"8a9eff90ce624aba8e34d51d9012abc3","snippet":"def tick(matrix): new_matrix = [row[:]for row in matrix] for i1,row in enumerate(matrix): for i2,cell in enumerate(row): if i1 == 0 or i1 == len(matrix) -1 or i2 == 0 or i2 == len(row)-1: neighbours = [] for r in range(max(0,i1-1), min(len(matrix),i1+2)): for c in range(max(0,i2-1), min(len(row),i2+2)): if r == i1 and c == i2: continue ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-23T15:21:41.000Z","is_out_of_date":false,"language":"python","author":{"handle":"Billster820"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/Billster820","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"e294826a6c9d4d76a66acb8abc205bc9","snippet":"def tick(matrix): if not matrix or not matrix[0]: return matrix rows = len(matrix) cols = len(matrix[0]) new_generation = [[0 for _ in range(cols)] for _ in range(rows)] for r in range(rows): for c in range(cols): ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":23,"iteration_status":"actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-24T03:17:42.000Z","is_out_of_date":false,"language":"python","author":{"handle":"YevhenIvashchenko"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/YevhenIvashchenko","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}},{"uuid":"2b1b9ef7246346af8da2b0737c765c89","snippet":"def tick(matrix): if not matrix: return [] rows = len(matrix) cols = len(matrix[0]) new_board = [[0 for _ in range(cols)] for _ in range(rows)] for r in range(rows): ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-14T04:55:56.000Z","is_out_of_date":false,"language":"python","author":{"handle":"sahana2006"},"exercise":{"title":"Гра життя Конвея","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/solutions/sahana2006","private_iterations_url":"https://exercism.org/uk/tracks/python/exercises/game-of-life/iterations"}}],"meta":{"current_page":1,"total_count":372,"total_pages":16,"unscoped_total":372}}}}}

Мовні треки

Вчимося програмувати з Jiki

Подорож

ОбранеНове

Переваги Exercism

Відео спільноти

Серія коротких вступів

Інтервʼю та історії

Discord

Форум

З чого почати

Наставництво

Документація

Учасники

ПерекладачіНове

Пожертвувати

Про Exercism

Наш вплив

Синхронізатор GitHubНове

Інсайдери