{"request":{"endpoint":"https://exercism.org/api/v2/tracks/groovy/exercises/linked-list/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"13c57dc7dc55448aafac423367a144f3","snippet":"class DoubleLinkedList { private Node head private Node tail void push(T value) { def node = new Node(value) if (tail) { node.prev = tail tail.next = node ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":96,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-07-21T17:43:16.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"glennj"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/glennj","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"c65c194be4794c609fa425b0041d4e15","snippet":"class DoubleLinkedList { def data = [] void push(T value) { data[data.size()] = value } T pop() { def poppedValue = data[data.size() - 1] data.removeAt(data.size() - 1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":30,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2019-04-15T21:17:38.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"utumno86"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/utumno86","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"71e65f3ac9084890be37f412adf8a314","snippet":"class DoubleLinkedList { Node first Node last void push(T value) { if (!first) { first = last = new Node(value: value) } else { def newNode = new Node(value: value, previous: last) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":54,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2019-07-15T21:46:08.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"ancho"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/ancho","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"5375711ad2314d0a81d73bab4916a69d","snippet":"class DoubleLinkedList { private Integer size = 0 private Node first private Node last void push(T value) { Node node = new Node(value) if (size == 0) { node.previous = node node.next = node ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":55,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2021-01-24T20:23:49.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"4joke"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/4joke","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"2893c50f0f8649cbbcc178d5cd59790d","snippet":"class DoubleLinkedList { Node head Node tail void push(T value) { Node newNode = new Node<>(value) newNode.prev = tail tail = newNode ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":58,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2022-04-06T13:56:57.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"Yevhenii-Khaliuk"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/Yevhenii-Khaliuk","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"4f5414f8f1404e619a865e8926b77aba","snippet":"class DoubleLinkedList { T value = null DoubleLinkedList next = null DoubleLinkedList prev = null DoubleLinkedList last = null DoubleLinkedList(){ this.value = null this.next = null this.prev = null ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":67,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2022-07-03T06:09:15.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"GalSomovic"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/GalSomovic","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"c5ce91e173fb47ada9fcf974474c03ee","snippet":"class Node { Node back; Node next; T value; } class DoubleLinkedList { Node start; Node end; ","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":"failed","published_at":"2022-10-09T12:14:12.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"JJTuddi"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/JJTuddi","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"0dbd929b86f94c8198d2dca91b2db34d","snippet":"class DoubleLinkedList { def list = [] void push(T value) { list.add(value) } T pop() { def look = list[list.size()-1] list.remove(list.size()-1) look } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2024-06-10T17:20:36.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"Macudsc"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/Macudsc","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"8c56d21b4aca40e495b179c7c77ae39b","snippet":"class Node { T value Node prev Node next Node(T value) { this.value = value this.prev = null this.next = null } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":68,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2024-02-13T11:47:51.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"MartinDekanovsky"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/MartinDekanovsky","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"f8f31c0bb6774ca69a6eb420659610b9","snippet":"class DoubleLinkedList { Element head void push(T value) { if (!head) { head = new Element<>(value, null, null) head.next = head head.prev = head return ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":46,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2019-04-25T21:44:34.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"amscotti"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/amscotti","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"0286cc97f0b74218b8e9353ff5c06bf0","snippet":"class DoubleLinkedList { private static class ListItem { private ListItem next private ListItem prev private T value T getValue() { value } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":95,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2019-07-20T08:25:38.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"anwarsky"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/anwarsky","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"8214c742415447cf801da195575496b6","snippet":"import groovy.transform.ToString @ToString class Node { T value Node next = null Node previous = null } class DoubleLinkedList { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":47,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2021-06-05T21:41:32.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"dynamo-patch"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/dynamo-patch","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"8672a43e77bf4c3e80e6a67d6595e1f9","snippet":"class DoubleLinkedList { Node head Node tail void push(T value) { Node newNode = new Node(value: value) newNode.next = null newNode.prev = tail if (tail == null) head = newNode ","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":"failed","published_at":"2021-07-23T21:35:22.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"gilesejb"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/gilesejb","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"4a7aa2795b024430af6e8006b43af3c5","snippet":"class DoubleLinkedList { class Node { T value Node previous Node next Node(T value) { this.value = value } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":54,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2020-10-08T13:54:47.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"steve-perkins"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/steve-perkins","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"2efe8a71daee4b8f83a32d3b775af954","snippet":"class DoubleLinkedList { class Node { Node next; Node previous; T data; Node(T data, Node next, Node previous) { this.data = data this.next = next this.previous = previous ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":59,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2020-10-22T22:45:55.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"grantlmiller"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/grantlmiller","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"b08266b17e294ba8855b4dda90de92e7","snippet":"class DoubleLinkedList { private static final class Node { Node previous Node next final T data Node(T data, Node previous, Node next) { this.data = data this.previous = previous ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":46,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2021-08-17T05:54:22.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"david82"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/david82","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"153a1ea5059b49749da6c95ada8c1e85","snippet":"class DoubleLinkedList { private Node first private Node last void push(T value) { Node node = new Node<>() node.value = value node.previous = last last?.next = node ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":51,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2023-01-19T22:27:10.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"gzacharski"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/gzacharski","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"22489329be434017825445d451e9d658","snippet":"class DoubleLinkedList { static class Node { Node prev Node next T value } Node head = null Node tail = null ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":41,"iteration_status":"analyzing","published_iteration_head_tests_status":"failed","published_at":"2024-10-06T04:07:54.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"AMathMonkey"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/AMathMonkey","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"98e4fe68b926443bbf6d04b20521c87f","snippet":"class DoubleLinkedList { private T value private DoubleLinkedList prev private DoubleLinkedList next DoubleLinkedList() { this.value = this.prev = this.next = null } ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":42,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2019-12-10T21:33:06.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"heptalophos"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/heptalophos","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"06f729283dbe4dc3ab48bbc0049145a5","snippet":"class DoubleLinkedList { private Node first private Node last private int length = 0 class Node { T value Node nextNode Node previousNode ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":60,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2019-12-30T21:17:42.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"suic86"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/suic86","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"6358c67777f5414ab595deca3f3f2cfe","snippet":"class DoubleLinkedList { def lst = new Node[2] int count DoubleLinkedList() { lst[0] = null lst[1] = null count = 0 } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":66,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2020-01-08T09:21:24.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"norricorp"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/norricorp","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"d9cd0557a4ae4a749b321ebfedfbbfba","snippet":"import groovy.transform.ToString class DoubleLinkedList { @ToString private class Node { T value Node previous Node next } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":35,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2022-10-29T16:45:50.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"menketechnologies"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/menketechnologies","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"6069007848be4232a3bc0b0eb63255c6","snippet":"class DoubleLinkedList { def list = []; void push(T value) { this.list.add(value) //throw new UnsupportedOperationException('Method implementation is missing') } T pop() { def n = this.list.size() - 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2021-11-08T21:47:16.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"aeschriefer"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/aeschriefer","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}},{"uuid":"11bc026f59bc4f3a8e7c734b3a7848f6","snippet":"class DoubleLinkedList { private Node first private Node last void push(T value) { def node = new Node(value: value, previous: last) if (last != null) last.next = node last = node if (!first) first = last ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2022-06-21T16:32:08.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"ehonsey"},"exercise":{"title":"Звʼязаний список","icon_url":"https://assets.exercism.org/exercises/linked-list.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/solutions/ehonsey","private_iterations_url":"https://exercism.org/uk/tracks/groovy/exercises/linked-list/iterations"}}],"meta":{"current_page":1,"total_count":34,"total_pages":2,"unscoped_total":34}}}}}

Мовні треки

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

Подорож

ОбранеНове

Переваги Exercism

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

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

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

Discord

Форум

З чого почати

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

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

Учасники

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

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

Про Exercism

Наш вплив

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

Інсайдери