{"id":26474005,"url":"https://github.com/asungur/data_structures_and_algos","last_synced_at":"2025-07-19T20:06:23.559Z","repository":{"id":129229783,"uuid":"291809440","full_name":"asungur/data_structures_and_algos","owner":"asungur","description":"Go,Ruby and Python implementations of common algorithms and data structures","archived":false,"fork":false,"pushed_at":"2024-09-28T18:10:47.000Z","size":132,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-03-19T22:42:23.477Z","etag":null,"topics":["algorithm","algorithms","data-structures","go","golang","interview","interview-preparation","ruby"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/asungur.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-08-31T19:45:28.000Z","updated_at":"2024-09-28T18:10:50.000Z","dependencies_parsed_at":"2024-09-18T18:48:20.129Z","dependency_job_id":null,"html_url":"https://github.com/asungur/data_structures_and_algos","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/asungur/data_structures_and_algos","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/asungur%2Fdata_structures_and_algos","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/asungur%2Fdata_structures_and_algos/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/asungur%2Fdata_structures_and_algos/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/asungur%2Fdata_structures_and_algos/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/asungur","download_url":"https://codeload.github.com/asungur/data_structures_and_algos/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/asungur%2Fdata_structures_and_algos/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266003086,"owners_count":23862653,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","algorithms","data-structures","go","golang","interview","interview-preparation","ruby"],"created_at":"2025-03-19T22:39:45.678Z","updated_at":"2025-07-19T20:06:23.498Z","avatar_url":"https://github.com/asungur.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# ➗Data Structures and Algorithms\n\nThis repository contains my solutions to popular algorithms and data structures.\n\nMy plan is to implement each solution in **Go** and **Ruby.** However, some problems might only have one implementation.\n\nSome problems include variations. These are kept in the same folder.\n\n## Algorithms\n\n[Definition](https://en.wikipedia.org/wiki/Algorithm)\n\nSet of rules to solve a given problem. Commonly, they work hand in hand with data structures.\n\n- [Binary Search](https://github.com/asungur/data_structures_and_algos/tree/main/algorithms/binary_search) | [wiki](https://en.wikipedia.org/wiki/Binary_search_algorithm)\n- [Bubble Sort](https://github.com/asungur/data_structures_and_algos/tree/main/algorithms/bubble_sort) | [wiki](https://en.wikipedia.org/wiki/Bubble_sort)\n- [Merge Sort](https://github.com/asungur/data_structures_and_algos/tree/main/algorithms/merge_sort) | [wiki](https://en.wikipedia.org/wiki/Merge_sort)\n- [Selection Sort](https://github.com/asungur/data_structures_and_algos/tree/main/algorithms/selection_sort) | [wiki](https://en.wikipedia.org/wiki/Selection_sort)\n- [Insertion Sort](https://github.com/asungur/data_structures_and_algos/tree/main/algorithms/insertion_sort) | [wiki](https://en.wikipedia.org/wiki/Insertion_sort)\n- [Quicksort](https://github.com/asungur/data_structures_and_algos/tree/main/algorithms/quicksort) | [wiki](https://en.wikipedia.org/wiki/Quicksort)\n- [Quickselect](https://github.com/asungur/data_structures_and_algos/tree/main/algorithms/quickselect) | [wiki](https://en.wikipedia.org/wiki/Quickselect)\n\n\n## Data Structures\n\n[Definition](https://en.wikipedia.org/wiki/Data_structure)\n\nDepending on the actual problem, using different data structures bring efficiency (speed/memory) to our solution. Understanding their trade-offs and where to use them is as important as understanding how they work.\n\n- [Linked list](https://github.com/asungur/data_structures_and_algos/tree/main/data_structures/linked_list) | [wiki](https://en.wikipedia.org/wiki/Linked_list)\n- [Doubly linked list](https://github.com/asungur/data_structures_and_algos/tree/main/data_structures/doubly_linked_list) | [wiki](https://en.wikipedia.org/wiki/Doubly_linked_list)\n- [Queue](https://github.com/asungur/data_structures_and_algos/tree/main/data_structures/queue) | [wiki](https://en.wikipedia.org/wiki/Queue_(abstract_data_type))\n- [Stack](https://github.com/asungur/data_structures_and_algos/tree/main/data_structures/stack) | [wiki](https://en.wikipedia.org/wiki/Stack_(abstract_data_type))\n- [Binary Search Tree](https://github.com/asungur/data_structures_and_algos/tree/main/data_structures/binary_search_tree) | [wiki](https://en.wikipedia.org/wiki/Binary_search_tree)\n- [Hash Table](https://github.com/asungur/data_structures_and_algos/tree/main/data_structures/hash_table) | [wiki](https://en.wikipedia.org/wiki/Hash_table) - WIP: implement linked-list collision handling for both\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fasungur%2Fdata_structures_and_algos","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fasungur%2Fdata_structures_and_algos","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fasungur%2Fdata_structures_and_algos/lists"}