{"id":16770340,"url":"https://github.com/ivanproskuryakov/algorithms-ts","last_synced_at":"2025-03-16T15:19:41.984Z","repository":{"id":249167013,"uuid":"579707602","full_name":"ivanproskuryakov/algorithms-ts","owner":"ivanproskuryakov","description":"Leetcode algorithms in TS","archived":false,"fork":false,"pushed_at":"2024-09-02T15:59:54.000Z","size":105,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-23T02:31:26.893Z","etag":null,"topics":["algorithms","data-structures","typescript"],"latest_commit_sha":null,"homepage":"https://leetcode.com/problemset/","language":"TypeScript","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/ivanproskuryakov.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":"2022-12-18T16:12:38.000Z","updated_at":"2024-09-02T15:59:58.000Z","dependencies_parsed_at":"2024-07-18T23:37:10.335Z","dependency_job_id":"21d5a252-ac75-4c7f-927c-27814dfb7144","html_url":"https://github.com/ivanproskuryakov/algorithms-ts","commit_stats":null,"previous_names":["ivanproskuryakov/algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanproskuryakov%2Falgorithms-ts","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanproskuryakov%2Falgorithms-ts/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanproskuryakov%2Falgorithms-ts/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanproskuryakov%2Falgorithms-ts/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ivanproskuryakov","download_url":"https://codeload.github.com/ivanproskuryakov/algorithms-ts/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243886079,"owners_count":20363664,"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","data-structures","typescript"],"created_at":"2024-10-13T06:23:50.123Z","updated_at":"2025-03-16T15:19:41.964Z","avatar_url":"https://github.com/ivanproskuryakov.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"### Data Structures\n\n```\nSet\n\tStore unique values, without any particular order\n\tDynamic/mutable sets\n\tAllow insertion and deletion of elements from the set\n\tStatic\n\tUnordered, unchangeable, and unindexed collection\n\t\tHashSet\n\t\tHashSet stores unique elements without any associated values\n\nList\u003cSet\u003e\n\tFinite number of ordered values, where the same value may occur more than once\n\t\tappend O(1)\n\t\tspace O(n)\n\nStack\u003cList\u003e\n\tA linear structure that stores items in LIFO manner\n\t\tpush O(1)\n\t\tpop O(1)\n\t\tspace O(n)\n\nQueue\u003cList\u003e\n\tA linear structure that stores items in FIFO manner\n\t\tenqueue O(1)\n\t\tdequeue O(1)\n\t\tspace O(n)\n\t\tPriority queue\n\nMap\n\tA Map holds key-value pairs where the keys can be any datatype.\n\tA Map remembers the original insertion order of the keys.\n\t\tsearch O(1)\n\t\tinsert O(1)\n\t\tdelete O(1)\n\t\tspace O(n)\n\nHash Map/Hash Table \n\tHashMap stores key-value pairs where the keys are unique identifiers and the values are associated data\n\t\tUnOrdered Map\n\t\tOrdered Map\n\t\tTree Map\n\t\tLinked Hash Map\n\t\tBloom Filter Map\n\nHash\n\tBloom filter\n\tRate Limit Nullifier\n\tDHT (Distributed hash table)\n\nGraph\n\tA graph can be connected or disconnected, can have cycles or loops, and does not necessarily have a root node\n\n\tTree\n\t\tA tree is a type of graph that is connected, acyclic (meaning it has no cycles or loops), and has a single root node.\n\n\t\t- Search O(log _n_)\n\t\t- Insert O(log _n_)\n\t\t- Delete O(log _n_)\n\n\t\tBinary Tree\n\t\t\tBalanced binary tree (BST)\n\t\tMerkel Tree\n\t\tHeap\n\t\t\tA Heap is a special Tree-based data structure in which the tree is a complete binary tree.\n```\n\n### Algorythms\n\n```\nSearch\n\tGraph\n\t\tDijkstra's algorithm\n\t\tMinimum spanning tree\n\tList\n\t\tLinear Search\n\t\tLinear Search Sentinel\n\t\tJump search\n\t\tBinary Search\n\t\tInterpolation search\n\t\tExponential Search\n\t\tJump search\n\t\tTernary search\n\t\tTree traversal\n\tSort\n\t\tList\n\t\t\tHeapsort\n\t\t\tMerge sort\n\t\t\tSelection sort\n\t\t\tSmooth sort\n\tHashing\n\t\tBloom filters\n\t\tMerkel Trees\n\t\tBFS \u0026 DFS\n\tRecursive\n\t\tDivide and conquer\n\t\tGreedy algorithm\n\t\tBacktracking\n\t\tDynamic programming\n\tAlgorithm design paradigm\n\t\tBranch and bound\n\t\tBrute-force search\n\t\tRecursion\n\t\tPrune and search\n\nOptimisation\n\tLinear programming\n\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fivanproskuryakov%2Falgorithms-ts","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fivanproskuryakov%2Falgorithms-ts","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fivanproskuryakov%2Falgorithms-ts/lists"}