{"id":13469740,"url":"https://github.com/yangshun/lago","last_synced_at":"2025-05-14T18:02:24.381Z","repository":{"id":25749303,"uuid":"95755693","full_name":"yangshun/lago","owner":"yangshun","description":"📕 Data Structures and Algorithms library in TypeScript and JavaScript","archived":false,"fork":false,"pushed_at":"2024-05-09T00:49:12.000Z","size":1052,"stargazers_count":2860,"open_issues_count":9,"forks_count":316,"subscribers_count":56,"default_branch":"master","last_synced_at":"2025-05-12T22:11:46.392Z","etag":null,"topics":["algorithm","data-structures","javascript","typescript"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/yangshun.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2017-06-29T08:26:56.000Z","updated_at":"2025-05-05T13:30:02.000Z","dependencies_parsed_at":"2023-01-14T08:30:27.303Z","dependency_job_id":"2f16a84e-7ba7-4eb2-be4c-c1a48eb09b4e","html_url":"https://github.com/yangshun/lago","commit_stats":{"total_commits":166,"total_committers":15,"mean_commits":"11.066666666666666","dds":0.3012048192771084,"last_synced_commit":"4276531887e1cce9dc4028de47159c32b0296fd0"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yangshun%2Flago","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yangshun%2Flago/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yangshun%2Flago/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yangshun%2Flago/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/yangshun","download_url":"https://codeload.github.com/yangshun/lago/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254198453,"owners_count":22030964,"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","data-structures","javascript","typescript"],"created_at":"2024-07-31T15:01:54.085Z","updated_at":"2025-05-14T18:02:24.277Z","avatar_url":"https://github.com/yangshun.png","language":"TypeScript","readme":"\u003ch1 align=\"center\"\u003eLago\u003c/h1\u003e\n\n\u003cdiv align=\"center\"\u003e\n  \u003cimg src=\"assets/logo.svg\" alt=\"Lago logo\" width=\"400\"/\u003e\n  \u003cbr\u003e\n  \u003cp\u003e\n    \u003cem\u003eCredits: Illustration by \u003ca href=\"https://undraw.co/\"\u003eunDraw\u003c/a\u003e\u003c/em\u003e\n  \u003c/p\u003e\n\u003c/div\u003e\n\n---\n\n\u003cdiv align=\"center\"\u003e\n  \u003ch3\u003e💡 Practice implementing Data Structures and Algorithms in JavaScript for free on \u003ca href=\"https://www.greatfrontend.com/focus-areas/data-structures-algorithms\"\u003eGreatFrontEnd\u003c/a\u003e 💡\u003c/h3\u003e\n\u003c/div\u003e\n\n---\n\n## Contents\n\nCommon Data Structures and Algorithms implementations in JavaScript.\n\n### Data Structures\n\n- [List](src/data-structures/List.ts)\n- [Stack](src/data-structures/Stack.ts)\n- [Queue](src/data-structures/Queue.ts)\n- [Double-ended Queue](src/data-structures/Deque.ts)\n- [Trie](src/data-structures/Trie.ts)\n- [Binary Tree](src/data-structures/BinaryTree.ts)\n- [Binary Search Tree](src/data-structures/BinarySearchTree.ts)\n- [N-D array](src/data-structures/NDArray.ts)\n- [Bloom Filter](src/data-structures/BloomFilter.ts)\n- [Disjoint-set](src/data-structures/DisjointSet.ts)\n- [Counter](src/data-structures/Counter.ts)\n- [Graph (map-based)](src/data-structures/Graph.ts)\n- [Priority Queue](src/data-structures/PriorityQueue.ts)\n- [AVL Tree](src/data-structures/AVLTree.ts)\n- [Heap](src/data-structures/Heap.ts)\n- Suffix Tree (Help Wanted!)\n- Segment Tree (Help Wanted!)\n\n### Algorithms\n\n- [Binary Search](src/algorithms/binarySearch.ts)\n- [Quickselect](src/algorithms/quickSelect.ts)\n- [Merge Sort](src/algorithms/mergeSort.ts)\n- [Quicksort](src/algorithms/quickSort.ts)\n- [Heap Sort](src/algorithms/heapSort.ts)\n- [Topological Sort](src/algorithms/topologicalSort.ts)\n- [Breadth-first Search](src/algorithms/breadthFirstSearch.ts)\n- [Depth-first Search](src/algorithms/depthFirstSearch.ts)\n- [Dijkstra's Algorithm](src/algorithms/dijkstra.ts)\n- [Floyd-Warshall Algorithm](src/algorithms/floydWarshall.ts)\n- [Bellman-Ford Algorithm](src/algorithms/bellmanFord.ts)\n\n## Development\n\n```sh\n$ yarn install\n$ yarn test --watch\n```\n\nBefore pushing/submitting PR\n\n```sh\n$ yarn check-all\n```\n","funding_links":[],"categories":["Related","TypeScript","data structures and algorithms","General Programming","Bachelor-Level"],"sub_categories":["[Grokking the Coding Interview: Patterns for Coding Questions](https://www.designgurus.io/course/grokking-the-coding-interview?aff=kJSIoU)","Algorithms","Bachelor Informatik/KI"],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyangshun%2Flago","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyangshun%2Flago","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyangshun%2Flago/lists"}