{"id":21919579,"url":"https://github.com/apulbere/algorithms","last_synced_at":"2025-03-22T10:19:08.947Z","repository":{"id":164582402,"uuid":"155073497","full_name":"apulbere/algorithms","owner":"apulbere","description":"data structures and algorithms","archived":false,"fork":false,"pushed_at":"2023-10-28T19:33:21.000Z","size":249,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-27T10:09:47.600Z","etag":null,"topics":["algorithms","computer-science","data-structures","dijkstra","graph","interview","interview-practice","java","java-21","junit5","kruskal","software-engineering","sorting-algorithms"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":false,"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/apulbere.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}},"created_at":"2018-10-28T13:21:57.000Z","updated_at":"2023-10-28T19:35:00.000Z","dependencies_parsed_at":null,"dependency_job_id":"8fb662da-87dc-4dec-916b-e8bbd67a22dc","html_url":"https://github.com/apulbere/algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/apulbere%2Falgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/apulbere%2Falgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/apulbere%2Falgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/apulbere%2Falgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/apulbere","download_url":"https://codeload.github.com/apulbere/algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244938219,"owners_count":20535199,"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":["algorithms","computer-science","data-structures","dijkstra","graph","interview","interview-practice","java","java-21","junit5","kruskal","software-engineering","sorting-algorithms"],"created_at":"2024-11-28T20:09:22.708Z","updated_at":"2025-03-22T10:19:08.926Z","avatar_url":"https://github.com/apulbere.png","language":"Java","readme":"## Algorithms\nData structures and algorithms in Java with test\n\n### Data Structures\n* [simple linked list](src/main/java/com/apulbere/algorithms/structure/SimpleLinkedList.java)\n* [queue with linked list](src/main/java/com/apulbere/algorithms/structure/LinkedListBasedQueue.java)\n* [hash map](src/main/java/com/apulbere/algorithms/structure/HashMapWithLinearProbing.java)\n* [binary tree](src/main/java/com/apulbere/algorithms/tree/BinaryTree.java)\n* [binary search tree](src/main/java/com/apulbere/algorithms/tree/BinarySearchTree.java)\n* [AVL tree](src/main/java/com/apulbere/algorithms/tree/AVLTree.java)\n* [heap](src/main/java/com/apulbere/algorithms/structure/Heap.java)\n* [disjoint-set / union-find](src/main/java/com/apulbere/algorithms/structure/DisjointSet.java)\n* [disjoint-set / union-find with path compression](src/main/java/com/apulbere/algorithms/structure/DisjointSetOptimized.java)\n\n### Sorting\n* [merge sort with O(n log n) space complexity](src/main/java/com/apulbere/algorithms/sort/MergeSort.java)\n* [merge sort with O(n) space complexity](src/main/java/com/apulbere/algorithms/sort/MergeSortOnSpaceComplexity.java)\n* [merge sort for linked list](src/main/java/com/apulbere/algorithms/sort/MergeSortForLinkedList.java)\n* [quick sort](src/main/java/com/apulbere/algorithms/sort/QuickSortLomutoPartition.java)\n* [quick sort using middle index as pivot](src/main/java/com/apulbere/algorithms/sort/QuickSortLomutoPartitionMiddlePivot.java)\n* [insert sort](src/main/java/com/apulbere/algorithms/sort/InsertSort.java)\n* [selection sort](src/main/java/com/apulbere/algorithms/sort/SelectionSort.java)\n\n### Graphs\n* [adjacency list representation](src/main/java/com/apulbere/algorithms/graph/AdjacencyListGraph.java)\n* [adjacency matrix representation](src/main/java/com/apulbere/algorithms/graph/AdjacencyMatrixGraph.java)\n* [Dijkstra algorithm for shortest path with adjacency list](src/main/java/com/apulbere/algorithms/graph/AdjacencyListWeightedGraph.java)\n* [Kruskal's Minimum Spanning Tree Algorithm](src/main/java/com/apulbere/algorithms/graph/mst/KruskalMinimumSpanningTree.java)\n* [Prim's Minimum Spanning Tree Algorithm](src/main/java/com/apulbere/algorithms/graph/mst/PrimMinimumSpanningTree.java)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fapulbere%2Falgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fapulbere%2Falgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fapulbere%2Falgorithms/lists"}