{"id":13902601,"url":"https://github.com/enginebai/Algorithms","last_synced_at":"2025-07-18T00:31:46.049Z","repository":{"id":38009212,"uuid":"200953711","full_name":"enginebai/Algorithms","owner":"enginebai","description":"Data Structures and Algorithm (in Kotlin \u0026 Python): notes, resources and problems/solutions.","archived":false,"fork":false,"pushed_at":"2024-08-06T01:57:10.000Z","size":8744,"stargazers_count":83,"open_issues_count":0,"forks_count":5,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-08-06T02:48:00.527Z","etag":null,"topics":["algorithm","algorithms","algorithms-and-data-structures","coding","coding-interviews","computer-science","data-structures","faang","faang-interview","interview","interview-preparation","interview-questions","kotlin","leetcode","python","python3"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":false,"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/enginebai.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":"2019-08-07T02:04:23.000Z","updated_at":"2024-08-06T02:48:02.698Z","dependencies_parsed_at":"2023-09-23T13:55:02.482Z","dependency_job_id":"4c5c803e-11cb-4112-b76a-15b3c2977a21","html_url":"https://github.com/enginebai/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/enginebai%2FAlgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/enginebai%2FAlgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/enginebai%2FAlgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/enginebai%2FAlgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/enginebai","download_url":"https://codeload.github.com/enginebai/Algorithms/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":214260260,"owners_count":15707070,"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","algorithms","algorithms-and-data-structures","coding","coding-interviews","computer-science","data-structures","faang","faang-interview","interview","interview-preparation","interview-questions","kotlin","leetcode","python","python3"],"created_at":"2024-08-06T22:01:14.191Z","updated_at":"2025-07-18T00:31:46.037Z","avatar_url":"https://github.com/enginebai.png","language":null,"readme":"Data Structures \u0026 Algorithms\n========\n\n![Cover](./media/cover.png)\nThis project offers a curated collection of notes and resources covering fundamental and widely used data structures and algorithms. It is designed to help software engineers to prepare for coding interviews and learn more about the fundamentals of computer science. For each topic, we provide a set of LeetCode problems and their solutions to practice after studying. You can follow the study path from beginner to intermediate level from the roadmap below, making your learning journey both structured and enjoyable. Happy coding!!\n\n## Study Topics\n- [Introduction](./topics/introduction.md)\n- [Complexity](./topics/complexity.md)\n- [Array \u0026 String](./topics/array.md) \n    - [Array](./problems/array-problems.md)\n    - [String](./problems/string-problems.md)\n    - [Two Pointers](./problems/two-pointers-problems.md)\n    - [Sliding Window](./problems/sliding-window-problems.md)\n- [Sorting](./topics/sorting.md)\n- [Hash Table](./topics/hash-table.md) ([Problems](./problems/hash-table-problems.md))\n- [Binary Search](./topics/binary-search.md) ([Problems](./problems/binary-search-problems.md))\n- [Linked List](./topics/linked-list.md) ([Problems](./problems/linked-list-problems.md))\n- [Stack \u0026 Queue](./topics/stack-queue.md) ([Problems](./problems/stack-queue-problems.md))\n- [Tree](./topics/tree.md)\n    - [Tree](./problems/tree-problems.md)\n    - [Binary Search Tree](./problems/bst-problems.md)\n- [Heap \u0026 Priority Queue](./topics/heap.md) ([Problems](./problems/heap-problems.md))\n- [Graph](./topics/graph.md) ([Problems](./problems/graph-problems.md))\n- [Shortest Path](./topics/shortest-path.md) ([Problems](./problems/shortest-path-problems.md))\n- [Recursion](./topics/recursion.md)\n- [Dynamic Programming](./topics/dynamic-programming.md) ([Problems](./problems/dynamic-programming-problems.md))\n- [Greedy](./topics/greedy.md) ([Problems](./problems/greedy-problems.md))\n- [Interval](./topics/interval.md) ([Problems](./problems/interval-problems.md))\n- [Design](./problems/design-problems.md)\n- [Backtracking](./topics/backtracking.md) ([Problems](./problems/backtracking-problems.md))\n\n## Personal Records\n- [Contest Records](./problems/contests.md)\n- [Review Records](./problems/reviews.md)\n\n## Roadmap\nThis study path designed to guide you from a beginner to an intermediate level, covering the essential topics in this project. It's important to note that certain topics are prerequisites for others. For example, you should master \"graph\" before studying \"shortest path\".\n\n![Roadmap](./media/roadmap.png)\n\n## LICENSE\n\n```\nCopyright (c) 2022 Engine Bai\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n```\n","funding_links":[],"categories":["Kotlin"],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fenginebai%2FAlgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fenginebai%2FAlgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fenginebai%2FAlgorithms/lists"}