{"request":{"endpoint":"https://exercism.org/api/v2/tracks/lua/exercises/binary-search/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"ddf4fa64462245e18ae9cb0149e9c3d4","snippet":"return function(array, target) local low, high = 1, #array while low <= high do local mid = math.floor((low + high) / 2) if array[mid] == target then return mid elseif array[mid] < target then low = mid + 1 else ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-26T11:39:45.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"johnhidey"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/johnhidey","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"7fab2bcf0ebb4369a50216f183de0739","snippet":"return function(array, target) local low = 1 local high = #array while low <= high do local mid = math.floor((low + high) / 2) if array[mid] == target then return mid elseif array[mid] < target then low = mid + 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-10T21:18:59.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"WTFox"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/WTFox","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"7d2c294398144b729a8e5381e02c9ec1","snippet":"return function(array, target) local left= 1 local right= #array local center while right - left>1 do center = left+(right - left)//2 if array[center]>target then right=center-1 elseif array[center]> 1) if array[index] == target then return index end if array[index] < target then left = index + 1 else right = index - 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-11T09:13:08.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"atk"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/atk","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"c696ba0403214618a221daec64453eb9","snippet":"return function(array, target) local function aux(start_index, end_index) if start_index >= end_index then return array[start_index] == target and start_index or -1 end local search_index = math.floor((end_index + start_index) / 2) if array[search_index] == target then return search_index ","num_views":0,"num_stars":3,"num_comments":3,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":16,"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":"lua","author":{"handle":"ryanplusplus"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/ryanplusplus","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"d1c231a9eac44d6c99dae928ee256257","snippet":" return function(array, target) local lower, upper = 1, #array while lower <= upper do local index = (lower + upper) // 2 local value = array[index] if value == target then return index end if value < target then ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-05-10T11:31:45.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"gumminoppe"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/gumminoppe","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"9a1b270a04974b0a9679376f2e376140","snippet":"return function(array, target) local low = 1 local high = #array while low <= high do local mid = math.floor((low + high)/2) if array[mid] == target then return mid elseif array[mid] > target then high = mid - 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-12-16T15:05:00.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"TopicalTop"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/TopicalTop","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"3fc8735f89fe40c2bf1dfae323615ead","snippet":"return function(array, target) left = 1 right = #array mid = 0 while(left <= right) do -- determine mid point, using floor division for out of bounds mid = (left + right) // 2 ","num_views":0,"num_stars":0,"num_comments":1,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-06-04T11:25:15.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"djmaster458"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/djmaster458","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"988bd07e8836454a81b7b955f8272139","snippet":"return function(array, target) local low = 1 local high = #array while low <= high do local mid = (high - low) // 2 + low local item = array[mid] if item == target then return mid elseif item < target then ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-06-06T16:44:08.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"zoloto112233"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/zoloto112233","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"9de29db3859d4b59aa9682b016c62c63","snippet":null,"num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-09-13T02:06:29.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"Steffan153"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/Steffan153","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"145a8fe6e7844a99ba46560ac51f0b4e","snippet":"local function result(array, index, value) if array[index] == value then return index else return -1 end end local function find(array, start_index, end_index, value) if start_index == end_index then return result(array, start_index, value) else local index = start_index + math.floor((end_index - start_index)/2) local current_value = array[index] ","num_views":0,"num_stars":1,"num_comments":2,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"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":"lua","author":{"handle":"schecky"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/schecky","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"17bbce4bebd543839974b92220915554","snippet":"local function mid(start, last) return math.floor((start + last) / 2) end local function recursiveSearch(array, value, start, last) local check = mid(start, last) if array[check] == value then return check end if start >= last then return -1 end if value > array[check] then start = check + 1 else last = check - 1 end ","num_views":0,"num_stars":1,"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":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"hkjlee109"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/hkjlee109","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"16c5d07ae1034b90a15df8a2df3c07d2","snippet":"return function (array, v) if #array == 0 then return -1 end local first, last = 1, #array while true do local pos = math.floor((first + last)/2) local cur = array[pos] if cur == v then return pos end if first == last then return -1 end if v > cur then first = pos + 1 ","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":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"italomaia"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/italomaia","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"e41aface49fe47c7bb4a061e53d22d76","snippet":"return function(array, target_value) local function binary_search(left, right) if left > right then return -1 end local middle = math.floor((right + left) / 2) local value = array[middle] if value < target_value then ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"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":"lua","author":{"handle":"blunckr"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/blunckr","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"4dd2b41956a04407a012134255c6f167","snippet":"local function binary_search(array, value, start, finish) start = start or 1 finish = finish or #array if finish < start then return -1 end local middle = math.floor((start + finish)/2) if value == array[middle] then return middle ","num_views":0,"num_stars":1,"num_comments":1,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":16,"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":"lua","author":{"handle":"BenOlmos"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/BenOlmos","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"d69a82528a964f0ea96dfad84d136f48","snippet":"return function (arr, elem) local function aux(lo, hi) if hi < lo then return -1 end local mid = (hi + lo) // 2 if elem == arr[mid] then return mid elseif elem < arr[mid] then return aux(lo, mid - 1) else ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"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":"lua","author":{"handle":"fyrchik"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/fyrchik","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"0d56a27bb51e451ab8ca6281a802210a","snippet":"local side = 1 local function middle(a, b) if side == 1 then side = -1 return math.floor((a + b) / 2) else side = 1 return math.ceil((a + b) / 2) end end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":44,"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":"lua","author":{"handle":"nikeinikei"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/nikeinikei","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"078fc8b91cb7460089e1244deec67f9a","snippet":"local binary_search = {} function binary_search(array, target) j = 0 targetIndex = -1 low = 1 counting = 1 while array[counting] ~= nil do counting = counting + 1 end ","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":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"KaitlynAnn99"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/KaitlynAnn99","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"066c1b0ea83c4ba8aea9349096e1c678","snippet":"local function updateMid(top, bottom) return math.ceil((top - bottom + 1) / 2) + bottom - 1 end local function log2 (x) return math.floor(math.log(x) / math.log(2)) end local function find(array, target) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":27,"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":"lua","author":{"handle":"CollinDietz"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/CollinDietz","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"69c1627c95e04057801e674cdc7b0f2d","snippet":"-- I misunderstood and thought we also needed to implement TracedArray. -- I decided I might as well leave it in. local function Callable(f) return { __call = f } end local TracedArray = { _new = function(self,t) t = t or {} ","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":"2018-10-12T01:18:39.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"Etherian"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/Etherian","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"a9eb42e711634486bf77791840951ac8","snippet":"local function recurse(array, searched, low, high) if low > high then return -1 end local mid = math.ceil((low + high) / 2) if array[mid] == searched then return mid elseif array[mid] > searched then ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-12-18T12:08:43.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"carolhmj"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/carolhmj","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"6babd66490ed47d78a06d54ea31ef256","snippet":"local function find(table, term) local first = 1 local last = #table while (first < last) do local avg = math.floor((first + last) / 2) if(table[avg] < term) then first = avg+1 else last = avg end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-03-15T00:54:08.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"Wise"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/Wise","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"8c235456dcc7405c85d4a2a12a2f2213","snippet":"local function find(array, i, min, max) if #array == 0 then return -1 end local min = min or 1 local max = max or #array if min == max then if array[min] == i then return 1 end ","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":"2019-02-06T01:38:01.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"mikowitz"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/mikowitz","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}},{"uuid":"11a764aa92be4ade9e1edc383c1b1b23","snippet":"-- Implement integer division so -- that code below should work for -- lua >= lua5.1 . local function DIV(a,b) return (a - a % b) / b end return function(array, target) local n = #array if n == 0 then return -1 end ","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":"2019-10-24T17:16:03.000Z","is_out_of_date":false,"language":"lua","author":{"handle":"anton19870803"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Lua","icon_url":"https://assets.exercism.org/tracks/lua.svg","highlightjs_language":"lua"},"links":{"public_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/solutions/anton19870803","private_iterations_url":"https://exercism.org/uk/tracks/lua/exercises/binary-search/iterations"}}],"meta":{"current_page":1,"total_count":376,"total_pages":16,"unscoped_total":376}}}}}

Мовні треки

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

Подорож

ОбранеНове

Переваги Exercism

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

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

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

Discord

Форум

З чого почати

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

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

Учасники

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

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

Про Exercism

Наш вплив

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

Інсайдери