{"id":49453680,"url":"https://github.com/aaronoah/algorithm-notes","last_synced_at":"2026-06-02T05:00:47.308Z","repository":{"id":305052284,"uuid":"77284214","full_name":"aaronoah/algorithm-notes","owner":"aaronoah","description":"Comprehensive algorithms solution to help engineers prepare their interviews and future study ","archived":false,"fork":false,"pushed_at":"2019-01-13T06:30:11.000Z","size":3670,"stargazers_count":57,"open_issues_count":0,"forks_count":20,"subscribers_count":2,"default_branch":"master","last_synced_at":"2026-03-06T00:59:30.642Z","etag":null,"topics":["algorithms","divide-and-conquer","dynamic-programming","graph-algorithms","greedy-algorithms","search-algorithm","sorting-algorithms","tree"],"latest_commit_sha":null,"homepage":"https://cs-notes.gitbook.io/algorithm-notes/","language":"HTML","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/aaronoah.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":".github/CONTRIBUTING.md","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,"zenodo":null}},"created_at":"2016-12-24T13:27:20.000Z","updated_at":"2024-06-18T16:25:23.000Z","dependencies_parsed_at":"2025-07-18T05:06:01.691Z","dependency_job_id":"afd26fb0-58c3-4ce4-a567-cd71549a5989","html_url":"https://github.com/aaronoah/algorithm-notes","commit_stats":null,"previous_names":["aaronoah/algorithm-notes"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/aaronoah/algorithm-notes","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aaronoah%2Falgorithm-notes","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aaronoah%2Falgorithm-notes/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aaronoah%2Falgorithm-notes/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aaronoah%2Falgorithm-notes/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aaronoah","download_url":"https://codeload.github.com/aaronoah/algorithm-notes/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aaronoah%2Falgorithm-notes/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33806987,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-02T02:00:07.132Z","response_time":109,"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","divide-and-conquer","dynamic-programming","graph-algorithms","greedy-algorithms","search-algorithm","sorting-algorithms","tree"],"created_at":"2026-04-30T04:01:03.703Z","updated_at":"2026-06-02T05:00:47.301Z","avatar_url":"https://github.com/aaronoah.png","language":"HTML","funding_links":[],"categories":["📦 Legacy \u0026 Inactive Projects"],"sub_categories":[],"readme":"\n\u003ca href=\"https://cs-notes.gitbook.io/algorithm-notes/\"\u003e\u003cimg src=\"https://github.com/aaronoah/algorithm-notes/blob/master/docs/images/logo.gif\" height=\"200\" align=\"right\"\u003e\u003c/a\u003e\n\n# algorithm-notes\n\nComprehensive algorithms solution to help engineers prepare their interviews and future study :cookie:\n\n## Motivation\n\nUnderstanding the algorithm mechanism is essential in structuring solutions for specific computation tasks and even more so in abstracting the most challenging questions such as Artificial Intelligence problems or Machine Learning techniques in various fields.\n\nConsider the importance of algorithm analysis in all branches of Computer Science and its novel insights in subjects like quantum mechanics, economic analysis and so on, it is necessary to know the domain knowledge of algorithm in terms of math and logic.\n\nIt is especially helpful for students, engineers and scientists to organize algorithm principles online.\n\n## Usage\n\nIn order to collaboratively take advantage of this material, usage in the following forms are welcomed:\n\n- Preview the documentation online, see [outlines](./docs/SUMMARY.md)\n- Access the online version: https://cs-notes.gitbook.io/algorithm-notes/\n- Clone or Fork this repo to build your own flavor of algorithm handbook or to submit Pull Request.\n\n### Getting Started\n\nClone the repo:\n```bash\ngit clone https://github.com/aaronoah/algorithm-notes.git\n```\n\nThen, review the book on your browser\n```bash\nnpm run serve\n```\n\nOr build the book\n```bash\nnpm run build\n```\n\n## Contributing\n\nMake sure you follow the [contributing guide](.github/CONTRIBUTING.md) in order to proceed with any forms of contribution.\n\n## License\n\n[MIT](https://opensource.org/licenses/MIT), Copyright \u0026copy; 2017, Hanqing Zhao\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faaronoah%2Falgorithm-notes","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faaronoah%2Falgorithm-notes","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faaronoah%2Falgorithm-notes/lists"}