{"request":{"endpoint":"https://exercism.org/api/v2/tracks/csharp/exercises/spiral-matrix/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"93a364c88370491f966b7791850ab068","snippet":"using System; public class SpiralMatrix { public static int[,] GetMatrix(int size) { int[,] matrix = new int[size, size]; int x = 0, y = 0, max = size - 1, min = 0; for(int i = 1; i <= size * size; i++) { ","num_views":0,"num_stars":20,"num_comments":3,"representation_num_published_solutions":32,"num_iterations":1,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-04-23T21:51:36.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"miurary"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/miurary","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"55678090f2a441f8b77f9c79073c0136","snippet":"public class SpiralMatrix { public static int[,] GetMatrix(int size) { int[,] matrix = new int[size, size]; int x = 0, y = 0, max = size - 1, min = 0; for(int i = 1; i <= size * size; i++) { matrix[y, x] = i; if (y == max && x != min) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":15,"num_iterations":2,"num_loc":27,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-12-31T14:11:49.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"sbormolini"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/sbormolini","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"287140fff0b74e06b2e4f9ad6fbb715f","snippet":"public class SpiralMatrix { public static int[,] GetMatrix(int size) { int[,] matrix = new int[size, size]; int count = 1; int startRow = 0, endRow = size - 1; int startCol = 0, endCol = size - 1; while (startRow <= endRow && startCol <= endCol) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":8,"num_iterations":1,"num_loc":41,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-05-12T19:20:55.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"EarthPulseAcademy"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/EarthPulseAcademy","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"35315cb85e384ce8af3bd3d25989f9d7","snippet":"using System; public class SpiralMatrix { public static int[,] GetMatrix(int size) { var matrix = new int[size, size]; var rowOffset = 0; var columnOffset = 0; ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":1,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-09-03T08:58:51.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"ErikSchierboom"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/ErikSchierboom","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"b73c79417a9441bb9695776a67147dee","snippet":"public static class SpiralMatrix { public static int[,] GetMatrix(int size) { var spiral = new int[size, size]; int numbersToPlace = size * size; int currentSpiralValue = 1; int firstPivot = 0, secondPivot = size - 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":1,"num_loc":32,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-03-28T13:29:42.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"CrazyZ"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/CrazyZ","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"c44ba3a31bdb4e64aec823a990841a7c","snippet":"using System; public class SpiralMatrix { public static int[,] GetMatrix(int size) { int[,] spiralMatrix = new int[size, size]; int l = 0, ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":5,"num_iterations":2,"num_loc":28,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-12-16T01:01:22.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"kitajoao"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/kitajoao","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"a3cee27b69b74bd886eb46c2b3b8f77a","snippet":"public static class SpiralMatrix { public static int[,] GetMatrix(int size) { var spiral = new int[size, size]; int numbersToPlace = size * size; int currentSpiralValue = 1; int firstPivot = 0, secondPivot = size - 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":32,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-03-10T12:46:32.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"Georgy010981"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/Georgy010981","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"c903d2f2c0cc42d5a9a1901afe47b33c","snippet":"public class SpiralMatrix { public static int[,] GetMatrix(int size) { int[,] matrix = new int[size, size]; int rowStart = 0; int rowEnd = size - 1; int colStart = 0; int colEnd = size - 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":43,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-06-20T09:23:10.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"bartoszclapinski"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/bartoszclapinski","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"29eef6db13e94037b5bf900a0d670d22","snippet":"public class SpiralMatrix { public static int[,] GetMatrix(int size) { int[,] matrix = new int[size, size]; int value = 1; int minRow = 0; int maxRow = size - 1; int minCol = 0; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":41,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-12-28T23:45:12.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"skiesfries"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/skiesfries","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"aaf61f591605444dbcc397413ad82857","snippet":"using System; public class SpiralMatrix { public static int[,] GetMatrix(int size) { var matrix = new int[size, size]; var rowOffset = 0; var columnOffset = 0; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-01-28T00:24:46.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"Cofa"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/Cofa","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"cc1a3f8003684dd4834c432c03fbc129","snippet":"using System; public class SpiralMatrix { public static int[,] GetMatrix (int size) { int[,] result = new int[size, size]; int right = size - 1, bottom = size - 1, left = 0, top = 1; int colIdx = 0, rowIdx = 0, id = 0; bool horizontal = true, leftToRight = true, topToBot = true; while (id < size * size) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":2,"num_loc":49,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"errored","published_at":"2019-02-27T09:02:20.000Z","is_out_of_date":true,"language":"csharp","author":{"handle":"omygod"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/omygod","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"b13f894d1d984a85bf9154b05a160ad4","snippet":"public class SpiralMatrix { public static int[,] GetMatrix(int size) { int[,] matrix = new int[size, size]; int num = 1; int startRow = 0; int endRow = size - 1; int startCol = 0; int endCol = size - 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":37,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-04T14:20:26.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"Hazeolation"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/Hazeolation","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"f1d5d6d23c86445db16f20505ebb342d","snippet":"internal class SpiralMatrix { public static int[,] GetMatrix(int size) { while (true) { int[,] array = new int[size, size]; int iterator = 0; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":68,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-10-19T13:09:33.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"Aurelio"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/Aurelio","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"717d28ff49974bfaa144a97e818b3cab","snippet":"using System; public class SpiralMatrix { public static int[,] GetMatrix(int size) { var terrain = new int[size,size]; var compass = new Compass(size); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":89,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-01-30T01:51:14.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"unjoker"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/unjoker","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"d6d416f9dac943c3b789f815cc59fba4","snippet":"public class SpiralMatrix { public static int[,] GetMatrix(int size) { var x = 0; var y = 0; var direction = Direction.Right; var edge = 0; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":73,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-08-27T09:20:11.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"dgee2"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/dgee2","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"e2026c4f45c5492e8862b545a0505a83","snippet":"public class SpiralMatrix { public static int[,] GetMatrix(int size) { int row = 0; int col = 0; int limitTopLeft = 0; int limitBottomRight = size - 1; int[,] matrix = new int[size, size]; ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":27,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-04-30T16:57:59.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"avekarant"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/avekarant","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"4d9bf5024a4447d68ca148683a873d7d","snippet":"public class SpiralMatrix { public static int[,] GetMatrix(int size) { int[,] matrix = new int[size, size]; int num = 1; int top = 0, bottom = size - 1, left = 0, right = size - 1; while (num <= size * size) ","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-02-19T07:25:20.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"Maxk12045"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/Maxk12045","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"e1f2330c3286464da5f6aa31a34ac037","snippet":"using System; public class SpiralMatrix { public static int[,] GetMatrix(int size) { int[,] array = new int[size, size]; int counter = 1; int c1 = 0, c2 = size - 1; while (counter <= size * size) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-07-04T08:16:40.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"michalszewa"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/michalszewa","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"94c723b6db5c4d9d97d3a7ef44cbed6b","snippet":"public class SpiralMatrix { public static int[,] GetMatrix(int size) { int[,] spiral = new int[size, size]; int value = 1; int minRow = 0, maxRow = size - 1, minCol = 0, maxCol = size - 1; while (value <= size * size) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":33,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-01-10T16:01:42.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"eronsalihu"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/eronsalihu","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"fa06696b02ec4470a895dff7dcb89322","snippet":"public class SpiralMatrix { public static int[,] GetMatrix(int size) { int[,] matrix = new int[size, size]; int num = 1; int left = 0, right = size - 1, top = 0, bottom = size - 1; while (num <= size * size) { ","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-10-10T03:41:53.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"IsmarMiranda"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/IsmarMiranda","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"2532ad5e3c9c4738808f214ef76a90a1","snippet":"public class SpiralMatrix { public static int[,] GetMatrix(int size) { if (size < 1) return new int[,] { }; var map = new int[size, size]; var row = 0; var col = 0; ","num_views":0,"num_stars":4,"num_comments":1,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":47,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"johnburkert"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/johnburkert","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"b5bf2a802815497cbe39f1ce4a74f2f9","snippet":"public class SpiralMatrix { public static int[,] GetMatrix(int size) { int[,] result = new int[size, size]; int[] dx = {0, 1, 0, -1}; int[] dy = {1, 0, -1, 0}; int dir = 0; int x0 = 0; int y0 = -1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":28,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-10-09T09:50:02.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"liuq901"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/liuq901","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"2d6f444e61d741dfa89231a36613a635","snippet":"public class SpiralMatrix { public static int[,] GetMatrix(int size) { int[,] matrix = new int[size, size]; int current = 1; int startRow = 0; int endRow = size - 1; int startCol = 0; int endCol = size - 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":43,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-16T22:29:08.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"BuuutyPeepo"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/BuuutyPeepo","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}},{"uuid":"7b2efbd4bf44483ba4db2f7e44a43ebe","snippet":"using System; public class SpiralMatrix { public static int[,] GetMatrix(int size) { var matrix = new int[size, size]; int limit = size; int counter = 0; int currentColumn = -1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":66,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-03-03T18:19:51.000Z","is_out_of_date":false,"language":"csharp","author":{"handle":"Benjamin23"},"exercise":{"title":"المصفوفة الحلزونية","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"C#","icon_url":"https://assets.exercism.org/tracks/csharp.svg","highlightjs_language":"csharp"},"links":{"public_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/solutions/Benjamin23","private_iterations_url":"https://exercism.org/ar/tracks/csharp/exercises/spiral-matrix/iterations"}}],"meta":{"current_page":1,"total_count":909,"total_pages":38,"unscoped_total":909}}}}}

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

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

رحلتك

مفضلاتكجديد

مزايا Exercism

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

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

مقابلات وقصص

Discord

المنتدى

البدء

الإرشاد

الوثائق

المساهمون

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

تبرّع

عن Exercism

أثرنا

مزامن GitHubجديد

Insiders