{"id":15798062,"url":"https://github.com/thomascode92/fem-algorithms","last_synced_at":"2025-08-18T13:04:08.805Z","repository":{"id":221856805,"uuid":"754316466","full_name":"ThomasCode92/fem-algorithms","owner":"ThomasCode92","description":"Learn about Big O, time complexity, fundamental data structures like arrays, lists, trees, graphs, and maps. Even searching and sorting algorithms. 💡📚","archived":false,"fork":false,"pushed_at":"2024-10-15T20:25:53.000Z","size":2122,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-10-17T06:59:21.490Z","etag":null,"topics":["algorithms","data-structures","frontendmasters","typescript"],"latest_commit_sha":null,"homepage":"","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/ThomasCode92.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":"2024-02-07T20:12:56.000Z","updated_at":"2024-10-15T20:25:57.000Z","dependencies_parsed_at":"2024-02-10T16:41:13.257Z","dependency_job_id":"e11636cf-ead4-4d7e-aebd-2d66c7cfa999","html_url":"https://github.com/ThomasCode92/fem-algorithms","commit_stats":{"total_commits":13,"total_committers":1,"mean_commits":13.0,"dds":0.0,"last_synced_commit":"cf84015d3d3e0b0f57ede152faa51bbcd69e5ba1"},"previous_names":["thomascode92/fem-algorithms"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ThomasCode92/fem-algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThomasCode92%2Ffem-algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThomasCode92%2Ffem-algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThomasCode92%2Ffem-algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThomasCode92%2Ffem-algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ThomasCode92","download_url":"https://codeload.github.com/ThomasCode92/fem-algorithms/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThomasCode92%2Ffem-algorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":270996917,"owners_count":24681940,"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","status":"online","status_checked_at":"2025-08-18T02:00:08.743Z","response_time":89,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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","frontendmasters","typescript"],"created_at":"2024-10-05T00:23:15.473Z","updated_at":"2025-08-18T13:04:08.776Z","avatar_url":"https://github.com/ThomasCode92.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# FrontendMaster - The Last Algorithms Course You'll Need\n\nA super fun, beginner-friendly data structures and algorithms course. 🎓\u003cbr /\u003e Is it really the last algorithms course you'll need? If you want to pass tough interview questions, then yes! 🤔\u003cbr /\u003eLearn about _Big O_, _time complexity_, fundamental data structures like arrays, lists, trees, graphs, and maps. Even searching and sorting algorithms. 💡📚\n\n**About this Repository**\u003cbr /\u003eThis repository is associated with [The Last Algorithms Course You'll Need](https://frontendmasters.com/courses/algorithms/) course from [FrontendMasters](https://frontendmasters.com/), taught by [ThePrimeagen](https://twitter.com/ThePrimeagen).\u003cbr /\u003eHere, you'll find all the exercises, example algorithms, and data structures covered in the course.\n\n## How To Use this Project\n\n### Table of Content\n\nThis project covers a wide range of algorithms and data structures, organized into the following topics:\n\n| Category | Data Structures/ Algorithms | Documentation |\n| --- | --- | --- |\n| Basics | Introduction, Big O, Arrays \u0026 Examples | [Basics](./docs/basics/index.md) |\n| Search | Binary Search, Linear Search \u0026\u003cbr /\u003eTwo Crystal Ball Problem | [Search](./docs/search/index.md) |\n| Sort | Bubble Sort, Linked List, Queue \u0026 Stack | [Sort](./docs/sort/index.md) |\n| Arrays | ArrayList \u0026 RingBuffer | [Arrays](./docs/arrays/index.md) |\n| Recursion | Recursion in General \u0026 Path Finding | [Recursion](./docs/recursion/index.md) |\n| Quick Sort | Divide and Conquer \u0026 Basic QuickSort | [Sort](./docs/sort/index.md) |\n| Doubly Linked List | Implement a DoublyLinkedList | [Sort](./docs/sort/index.md) |\n| Trees | Trees Overview \u0026 Tree Traversal (DFS) | [Trees](./docs/trees/index.md) |\n| Tree Search | Breadth-First-Search \u0026 Binary Search Tree | [Trees](./docs/trees/index.md) |\n| Heap | Heap Overview \u0026 Tries | [Heap](./docs/heap/index.md) |\n| Graphs | Adjacency List, Adjacency Matrix \u0026\u003cbr /\u003eDijkstra's Shortest Path | [Graphs](./docs/graphs/index.md) |\n| Maps \u0026 LRU | Maps Overview \u0026 LRU Caching | [Maps](./docs/maps-lru/index.md) |\n\n### Testing the Algorithms \u0026 Data Structures\n\nTo run the algorithms and data structures tests, ensure Node.js is installed on the system. Refer to the [official documentation](https://nodejs.org/en) for installation instructions. If [asdf](https://asdf-vm.com/) is being used, Node.js can also be installed via the `.tool-versions` file. More information on this is available [here](https://asdf-vm.com/manage/configuration.html#tool-versions).\n\nOnce Node.js is installed, follow these steps to set up and test the application:\n\n```bash\ngit clone https://github.com/ThomasCode92/fem-algorithms.git\ncd fem-algorithms   # navigate into project folder\nnpm install         # install dependencies\nnpm run test        # run all unit tests\n```\n\nRo run tests for a specific file, use the following command: `npx jest \u003cFILE\u003e`. For example, to test the _QuickSort_ implementation, run: `npx jest QuickSort`.\n\n**Contributing**\u003cbr /\u003ePlease note that some files in the [.src folder](./src/) have not been implemented yet. Contributions are welcome, and those interested in enhancing the project can fork the repository, implement the missing functionality, and submit a pull request. This will help improve the overall quality of the project.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthomascode92%2Ffem-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fthomascode92%2Ffem-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthomascode92%2Ffem-algorithms/lists"}