{"request":{"endpoint":"https://exercism.org/api/v2/tracks/dart/exercises/spiral-matrix/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"e4d8f2c48fdb4e2bb4076e9269c6458a","snippet":"class SpiralMatrix { final List> _matrix; SpiralMatrix(int size) : _matrix = _generateMatrix(size); static List> _generateMatrix(int size) { List> matrix = List.generate(size, (_) => List.filled(size, 0)); int value = 1; int top = 0, bottom = size - 1; int left = 0, right = size - 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":20,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-30T15:42:34.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"Denil24"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/Denil24","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"23cf7bf153dc42cda304d48a5a600ee8","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { final List> lst = List.generate(size, (_) => List.filled(size, 0)); int i = 0, j = 0; int di = 0, dj = 1; int k = 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":24,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-07-01T05:03:15.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"noelpaulrinso"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/noelpaulrinso","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"698f950ac49f4ce5af518bd2cca43c99","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { final List> lst = List.generate(size, (_) => List.generate(size, (_) => 0)); int i = 0; int j = 0; int di = 0; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-05-07T08:02:49.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"stackcats"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/stackcats","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"ca9e57a0ac2947389ad6693ff90f762b","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { if (size == 0) return []; final matrix = List.generate(size, (_) => List.filled(size, 0)); int num = 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":34,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-08-03T04:55:35.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"KeyboarKat-1"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/KeyboarKat-1","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"a02deaafa15a45a39eceadb3ccaf1c25","snippet":"/* Matrix left->right => X up -> down => Y */ enum Direction { Right, Down, Left, ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":56,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-08-04T11:58:11.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"sysapi"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/sysapi","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"48621eb04c72486897527d0d06e8efe6","snippet":"typedef Row = List; class SpiralMatrix { int size; List solution; SpiralMatrix(this.size) : solution = [] { for (int i = 0; i < size; i++) { solution.add(Row.filled(size, 0)); } fillBorder(1, 0); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-11-03T11:46:56.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"phijalog"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/phijalog","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"2376ecfd1727422ca8a2605def24374d","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { // Edge case: empty matrix if (size == 0) { return []; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":45,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-12-14T09:39:16.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"alwaysvivek"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/alwaysvivek","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"3eef5d892f0b42e9a136678cfe8433b5","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { if (size == 0) return []; List> matrix = List.generate(size, (_) => List.filled(size, 0, growable: false)); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":35,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-07-28T05:20:08.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"sweetyv789"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/sweetyv789","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"c77771d585b146b6bec259ed06b3529d","snippet":"class SpiralMatrix { int size; SpiralMatrix(this.size); List> toList() { List> matrix = List.generate(size, (_) => List.filled(size, 0)); int num = 1; int top = 0, bottom = size - 1, left = 0, right = size - 1; while (top <= bottom && left <= right) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":39,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-08-22T03:44:15.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"mohamed-hafoly"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/mohamed-hafoly","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"8d31c9213a764dd7876fb954e11d44ae","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { final matrix = List.generate(size, (_) => List.filled(size, 0)); int value = 1; int top = 0, bottom = size - 1; int left = 0, right = size - 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":33,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-08-03T09:14:49.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"Loki10"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/Loki10","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"2768f55fffd64afdb4a7275e264d0af8","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { if (size == 0) return []; final matrix = List.generate(size, (_) => List.filled(size, 0)); int num = 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":36,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-08-04T03:03:15.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"satya112131"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/satya112131","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"57f7b3ef4ea44442bd5f9191641921d3","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { if (size <= 0) return []; // Initialize an empty square grid (size x size) filled with 0s List> matrix = List.generate( ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":39,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-07-24T05:13:22.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"ruchithadasari89"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/ruchithadasari89","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"9cb2336de6c84ed09775e3d8d0467ecd","snippet":"class SpiralMatrix { int n; SpiralMatrix(this.n); List> toList(){ var matrix = List.generate(n, (r)=> List.generate(n, (c)=>0, growable: false)); final List> deltas = [ [0,1], [1,0], [0,-1], [-1,0]]; int posX = 0; ","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":"2026-08-28T10:47:43.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"efwhofmann"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/efwhofmann","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"91604beadc1444a991b16a4df8637ede","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { if (size == 0) return []; // Initialize empty matrix final matrix = List.generate(size, (_) => List.filled(size, 0)); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":36,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-08-03T07:58:20.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"Tirumalasetti-Tejaswini"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/Tirumalasetti-Tejaswini","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"0c975312babf41bdad8f84ceaa428d56","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { if (size == 0) return []; final matrix = List.generate(size, (_) => List.filled(size, 0)); int num = 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":36,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-08-04T04:49:52.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"divya-19999"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/divya-19999","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"192cfae9cf334e318f7b63efc62fbedc","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { // Initialize a 2D list with zeros List> matrix = List.generate(size, (i) => List.filled(size, 0)); int top = 0, bottom = size - 1, left = 0, right = size - 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":32,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-08-04T05:02:49.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"Tatavarthisravani"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/Tatavarthisravani","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"4b41a2e8ad15435ab2dbc4f7c5058d67","snippet":"enum Direction { HorizontalLeft, VerticalUp, HorizontalRight, VerticalDown; Direction turnRight() { return switch (this) { Direction.HorizontalLeft => Direction.VerticalUp, Direction.VerticalUp => Direction.HorizontalRight, ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":49,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-12-13T17:59:15.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"SylaneCpn"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/SylaneCpn","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"2ae9c5161ab04de9acd430b5185c38ca","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { if (size <= 0) return []; List> matrix = List.generate(size, (_) => List.filled(size, 0)); int left = 0, right = size - 1, top = 0, bottom = size - 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":33,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-07-27T09:47:34.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"mariam-280"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/mariam-280","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"2a23cf41a9f94cd08ce00b1c60be236b","snippet":"typedef Matrix = List>; class SpiralMatrix { final int size; SpiralMatrix(this.size); Matrix _matrix = []; static const _empty = -1; Matrix toList() { ","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":"2024-06-21T13:42:49.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"glennj"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/glennj","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"c6895daad64b4d0190582f5c18c2cd6c","snippet":"class SpiralMatrix { final int matrixSize; late List> _matrix; SpiralMatrix(this.matrixSize){ _matrix = List.generate(matrixSize, (_) => List.filled(matrixSize, 0)); } List> toList(){ ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":60,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-30T10:52:19.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"Pans88"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/Pans88","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"291fa2aad2f94cc397aad02e1398eaa8","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { final matrix = List.generate(size, (_) => List.filled(size, 0)); int row = 0, col = 0; int dirRow = 0, dirCol = 1; int value = 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":26,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-06-26T14:02:50.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"HelanAnto"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/HelanAnto","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"b6218ea6125d4b1086ecc53cc6fa6213","snippet":"class SpiralMatrix { final List> _matrix; SpiralMatrix(int size) : _matrix = _generateMatrix(size); static List> _generateMatrix(int size) { List> matrix = List.generate(size, (_) => List.filled(size, 0)); int value = 1; int top = 0, bottom = size - 1; int left = 0, right = size - 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":"2025-07-09T10:01:06.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"rezkun"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/rezkun","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"ebd79da97ea1462c9787f439b34bb44e","snippet":"enum Direction {right, down, left, up} class SpiralMatrix { int size; SpiralMatrix(this.size); static (int, int) new_coords(Direction dir, row, col) { int new_row; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":53,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-02-01T01:00:22.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"Bud-ro"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/Bud-ro","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}},{"uuid":"f28ad91080c9402ea30aa91a3f6e3b88","snippet":"class SpiralMatrix { final int size; SpiralMatrix(this.size); List> toList() { if (size <= 0) { return []; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":41,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-06-13T15:27:20.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"david82"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/solutions/david82","private_iterations_url":"https://exercism.org/ar/tracks/dart/exercises/spiral-matrix/iterations"}}],"meta":{"current_page":1,"total_count":38,"total_pages":2,"unscoped_total":38}}}}}

مسارات اللغات

تعلّم البرمجة مع Jiki

رحلتك

مفضلاتكجديد

مزايا Exercism

فيديوهات المجتمع

سلسلة المقدمات الموجزة

مقابلات وقصص

Discord

المنتدى

البدء

الإرشاد

الوثائق

المساهمون

المترجمونجديد

تبرّع

عن Exercism

أثرنا

مزامن GitHubجديد

Insiders