{"request":{"endpoint":"https://exercism.org/api/v2/tracks/nim/exercises/spiral-matrix/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"28f646973f3547b09cf8798fbc3b8168","snippet":"proc spiral*(size: static int): array[size, array[size, int]] = let (dx, dy) = ([0, 1, 0, -1], [1, 0, -1, 0]) var (x, y, num) = (0, -1, 1) for i in 0..<2 * size: for j in 0..<(2 * size - i) div 2: x += dx[i mod 4] y += dy[i mod 4] result[x][y] = num num += 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-11-01T21:35:37.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"Kosteg"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/Kosteg","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"6a4f3a3a8d744d8faacbe98c57bf75d0","snippet":"func spiral*(n: static int): array[n, array[n, int]] = var i, j: int di = 0 dj = 1 v = 1 lane = n - 1 template fill() = result[i][j] = v ","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-04-12T09:41:34.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"autf"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/autf","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"679c743d7b1c4150b8713b3d4792fb3c","snippet":"iterator it_arr_ix(d:int):tuple[x,y:int] = var offset,x,y = 0 for x in 0 ..< (d - offset): if (x+1) mod d > 0: yield (x,y) else: for y in 0 ..< (d - offset): yield (x,y) inc offset ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-07-14T14:59:40.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"xkqqkx"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/xkqqkx","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"f820b35aaec24c0cb1b1ec79eeb08ec6","snippet":"type Direction = enum Right Down Left Up Cursor = tuple[x: int, y: int] func `+`(cur: Cursor, dir: Direction): Cursor = result = cur ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":5,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-06-02T14:21:45.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"Archargelod"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/Archargelod","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"db7bfa98c0f845c1b62ae4fb9b53663f","snippet":"type Direction = enum Right, Down, Left, Up const Move = [Right: (0, 1), Down: (1, 0), Left: (0, -1), Up: (-1, 0)] proc spiral*(n: static int): array[n, array[n, int]] = var coord = (0, 0) var d = Direction.low var move = Move[d] for i in 0 .. (n * n) - 1: ","num_views":0,"num_stars":0,"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":"2023-04-28T07:44:24.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"dlcmh"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/dlcmh","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"82f934c5a1a14a2b8cc6c03820e5875e","snippet":"proc spiral*(n: static int): array[n, array[n, int]] = var mtrx: array[n, array[n, int]] var st = 1 var m = 0 if n == 0: return mtrx let ct = n div 2 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-11-03T19:56:31.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"BakinSergey"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/BakinSergey","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"3f524f5d464b4ff3ac447c3add282331","snippet":"proc spiral*(n: static int): array[n, array[n, int]] = let directions = [(0, 1), (1, 0), (0, -1), (-1, 0)] var x, y = 0 var dirId = 0 for i in 1 .. n*n: result[x][y] = i var nx = x + directions[dirId][0] var ny = y + directions[dirId][1] if nx < 0 or nx >= n or ny < 0 or ny >= n or result[nx][ny] != 0: dirId = (dirId + 1) mod 4 ","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":"2024-09-26T23:02:50.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"rnbwdsh"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/rnbwdsh","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"1f734a9683f94ec6835841cf2edb985f","snippet":"proc spiral(dim, start: int): seq[seq[int]] = if dim == 1: return @[@[start]] result.add((start..<(start+dim)).toSeq()) for i in 1..= width - b: j.dec ","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":"2021-02-26T02:51:40.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"song10"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/song10","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"1fe8f0e8bdce4bf692e1860a4277bcbb","snippet":"type Direction* = enum Left, Down, Right, Up proc spiral*(N: static[int]): array[N, array[N, int]] = var top, left = 0 bottom, right = N - 1 direction = Left matrix = newSeqWith(N, newSeq[int](N)) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":39,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-07-27T16:41:31.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"leonistor"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/leonistor","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"4a6b414eb6c04429a33ffff6aa744469","snippet":"proc spiral*(n: static int): array[n, array[n, int]] = var pos = 0 var num = 1 while num <= n * n: let nextPos = pos+1 let maxPos = n-nextPos for c in countup(pos, maxPos): result[pos][c] = num num.inc for r in countup(nextPos, maxPos): ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-11-28T13:40:02.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"paniedziela"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/paniedziela","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"05e2d547f00b4c09a8afc81cd9c50a43","snippet":"type Direction = enum Right, Down, Left, Up proc spiral*(size: static int): array[size, array[size, int]] = var top, left, counter = 0 bottom, right = size - 1 direction: Direction = Right ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":6,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-10T13:50:04.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"david82"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/david82","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"b4a955d218cc4d8a8a574b20c3be3817","snippet":"proc spiral*(size: static[int]): array[size, array[size, int]] = var rowOffset = 0 var columnOffset = 0 var totalNumbers = size * size var currentNumber = 1 while currentNumber <= totalNumbers: for topColumn in columnOffset ..< size - columnOffset: result[rowOffset][topColumn] = currentNumber ","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":"2020-09-19T14:29:49.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"ErikSchierboom"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/ErikSchierboom","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"fb4f27e855954b328f3a73e8a08b16bd","snippet":"proc spiral*(n: static int): array[n, array[n, int]]= var direction = [(0, 1), (1, 0), (0, -1), (-1, 0)] (dr, dc) = direction[0] r = 0 c = 0 for i in 1..n*n: result[r][c] = i let idx = if dr > 0: r + dr else: c + dc if idx < 0 or idx == n or result[r+dr][c+dc] != 0: ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-10-16T14:34:39.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"bonus"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/bonus","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"e50725817dce494bb41f368b08b259fe","snippet":"proc spiral*(size: static int): array[size, array[size, int]] = var counter = 1 var minx = 0 miny = 0 maxx = size-1 maxy = size-1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-05-20T06:42:57.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"TinBryn"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/TinBryn","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"c0dc212d57f641208a9b2004db8997a8","snippet":"iterator spiralcoords(n: int): (int, int) = var start = 0 stop = n - 1 while stop >= start: for x in countup(start, stop): yield (x, start) for y in countup(start + 1, stop): yield (stop, y) for x in countdown(stop - 1, start): ","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-04-17T00:58:56.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"stellartux"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/stellartux","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"98fe5f4e99ef406d92d3db4082b82e5c","snippet":"type Delta = tuple[x, y: int] proc initDeltas(): Deque[Delta] = result = initDeque[Delta]() result.addLast (0,1) result.addLast (1,0) result.addLast (0,-1) result.addLast (-1,0) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":5,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-10-13T22:04:33.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"glennj"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/glennj","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"baf52eccd2304b35971dfa438076bcb2","snippet":"type Direction = enum Right, Down, Left, Up proc spiral*(n: static int): array[n, array[n, int]] = var i = 1 d = 1 pos = (0, 0) dir = Right while i <= n*n: ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":37,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-03-16T08:29:26.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"a-ho"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/a-ho","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}},{"uuid":"07444af7027e4dd28717e8ba276faf9f","snippet":"template fill(exp) = x = 1 while x < size: result[i][j] = n inc n inc x exp func spiral*(size: static int): array[size, array[size, int]] = if size == 0: return ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-18T11:24:54.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"AmjadHD"},"exercise":{"title":"সর্পিল ম্যাট্রিক্স","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/solutions/AmjadHD","private_iterations_url":"https://exercism.org/bn/tracks/nim/exercises/spiral-matrix/iterations"}}],"meta":{"current_page":1,"total_count":40,"total_pages":2,"unscoped_total":40}}}}}

ভাষার ট্র্যাক

Jiki-এর সাথে কোড শেখা

আপনার যাত্রা

আপনার পছন্দের তালিকানতুন

Exercism-এর সুবিধা

কমিউনিটি ভিডিও

সংক্ষিপ্ত পরিচিতি সিরিজ

সাক্ষাৎকার ও গল্প

Discord

ফোরাম

শুরু করা

মেন্টরিং

ডকুমেন্টেশন

কনট্রিবিউটর

অনুবাদকনতুন

ডোনেট করুন

Exercism সম্পর্কে

আমাদের প্রভাব

GitHub সিঙ্কারনতুন

ইনসাইডার্স