{"request":{"endpoint":"https://exercism.org/api/v2/tracks/vlang/exercises/pascals-triangle/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"48193701a6ce44f2846abf6ea41828cc","snippet":"module main pub fn rows(height int) [][]int { mut result := [][]int{ cap: height } if height == 0 { return result } mut previous_row := [1] result << previous_row for _ in 1 .. height { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-11-18T19:52:54.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"keiraville"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/keiraville","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"256c8e223a4f4e878578c7ec2698faaf","snippet":"module main pub fn rows(height int) [][]int { mut res := [][]int{len: height, init: []int{len: index + 1, init: 1}} for row in 2 .. height { for col in 1 .. res[row].len - 1 { res[row][col] = res[row - 1][col - 1] + res[row - 1][col] } } return res ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-01-15T18:40:51.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"meteoraxv"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/meteoraxv","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"33037479d41c4dad83df3835475ad40f","snippet":"module main pub fn rows(height int) [][]int { match height { 0 { return [] } 1 { return [[1]] } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-10-02T10:04:10.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"M1Da5"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/M1Da5","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"ac864be664fe49f99a2e5df2901cc9f2","snippet":"module main pub fn rows(height int) [][]int { mut ret := [][]int{} for lines := 1; lines <= height; lines++ { ret << []int{} mut coef := 1 for i := 1; i <= lines; i++ { ret[lines - 1] << coef coef = coef * (lines - i) / i ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-08-18T06:35:25.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"kenzanin"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/kenzanin","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"3beca5a79049480ebaeeca44c6af09ba","snippet":"module main pub fn rows(height int) [][]int { return memo[..height] } const ( size = 10 memo = make_memo() ) ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-10-30T14:26:18.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"autf"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/autf","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"7647ecc9a1a84a46bf51f8d2e743922f","snippet":"module main pub fn rows(height int) [][]int { mut result := [][]int{} mut last_row := []int{} mut row := []int{} for _ in 0..height{ row = []int{} ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-06-20T02:02:17.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"torial"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/torial","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"a70cea7f4cbd493cb9773b388e8691ff","snippet":"module main pub fn rows(height int) [][]int { mut tree := [][]int{} if height > 0 { for row in 0 .. height { mut level := []int{len: row + 1} level[0] = 1 ","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":"2023-12-13T22:37:02.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"VictoriaClubSandwich"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/VictoriaClubSandwich","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"6204b476b505470a81729dd049e1720c","snippet":"module main pub fn rows(height int) [][]int { if height == 0 { return [] } else if height == 1 { return [[1]] } // this is a bit of a cheat, but makes the code simpler mut triangle := [[1], [1, 1]] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-08T01:40:27.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"andomray"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/andomray","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"9decf46885894bdcb90ff28c5e369fa6","snippet":"module main import arrays { window, sum } pub fn rows(height int) [][]int { mut result := [][]int{cap: height} if height > 0 { result << [1] // First row only if height is greater than 0 } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":18,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2023-10-01T22:48:18.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"david82"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/david82","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"9576517d3cbd4b9c86c247d02c5b4870","snippet":"module main pub fn rows(height int) [][]int { if height == 0 { return [][]int{} } mut res := [][]int{len: height} for i in 0 .. height { if i == 0 { res[0] = [1] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-03-25T08:42:15.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"jymk"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/jymk","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"7e50e2fe08d542c0b44bbf8139e5fab0","snippet":"module main pub fn rows(height int) [][]int { mut out := [][]int{} for i in 0..height { columns := i + 1 if columns == 1 { out << [1] continue } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-05T19:54:30.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"peterk87"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/peterk87","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"29f48fce585e4948b2868516ef1f98f2","snippet":"module main pub fn rows(height int) [][]int { if height == 0 { return [][]int{} } mut result := [][]int{len: 1, init: [1]} for h in 1..height { mut row := []int{} for i in 0..result[h - 1].len + 1 { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":27,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-09-18T11:04:42.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"alfaus"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/alfaus","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"06b21fe09eae4797bd2f4eba527d1dfd","snippet":"module main pub fn rows(height int) [][]int { mut res := [][]int{} mut row := []int{} for line := 0; line < height; line++ { for i := 0; i <= line; i++ { row << binomial_coeff(line, i) } res << row ","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":"2024-09-25T13:14:49.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"holgert"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/holgert","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"7957e566ff8d4c73ad5046a454f9a69c","snippet":"module main import arrays { window, sum } pub fn rows(height int) [][]int { mut result := [][]int{} for row in 0 .. height { if row == 0 { result << [1] } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-14T17:23:56.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"avrame"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/avrame","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"4193ebdd0eb64af6a1d82d30d549f803","snippet":"module main pub fn rows(height int) [][]int { mut res := [][]int{len: height, init: []int{len: index + 1, init: 1}} for y in 2 .. height { for x in 1 .. res[y].len - 1 { res[y][x] = res[y - 1][x - 1] + res[y - 1][x] } } return res ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-22T09:45:54.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"amiga"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/amiga","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}},{"uuid":"844f311daac64b2b90ab746de102452e","snippet":"module main pub fn rows(height int) [][]int { if height == 0 { return [] } mut res := [[1]] for row in 1 .. height { mut values := []int{cap: row + 1} mut prev := 0 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-06-17T14:23:12.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"hl4"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"V","icon_url":"https://assets.exercism.org/tracks/vlang.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/solutions/hl4","private_iterations_url":"https://exercism.org/el/tracks/vlang/exercises/pascals-triangle/iterations"}}],"meta":{"current_page":1,"total_count":16,"total_pages":1,"unscoped_total":16}}}}}

Γλώσσες προγραμματισμού

Μάθε προγραμματισμό με το Jiki

Το Ταξίδι σου

Τα Αγαπημένα σουΝέο

Προνόμια του Exercism

Βίντεο της Κοινότητας

Σειρά σύντομων εισαγωγών

Συνεντεύξεις και ιστορίες

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

Συνεισφέροντες

ΜεταφραστέςΝέο

Κάνε δωρεά

Σχετικά με το Exercism

Ο αντίκτυπός μας

Συγχρονισμός GitHubΝέο

Insiders