{"id":44038483,"url":"https://github.com/1st/algorithms","last_synced_at":"2026-02-07T20:12:51.145Z","repository":{"id":147770895,"uuid":"67778800","full_name":"1st/algorithms","owner":"1st","description":"Algorithms and Data Structures","archived":false,"fork":false,"pushed_at":"2025-11-02T11:46:21.000Z","size":130,"stargazers_count":7,"open_issues_count":1,"forks_count":1,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-11-02T13:19:07.327Z","etag":null,"topics":["algorithms","coding-interviews","data-structures","interview","python"],"latest_commit_sha":null,"homepage":"https://google.com","language":null,"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/1st.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":"AGENTS.md","dco":null,"cla":null}},"created_at":"2016-09-09T07:57:04.000Z","updated_at":"2025-10-18T23:36:20.000Z","dependencies_parsed_at":"2023-06-17T00:45:54.781Z","dependency_job_id":null,"html_url":"https://github.com/1st/algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/1st/algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1st%2Falgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1st%2Falgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1st%2Falgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1st%2Falgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/1st","download_url":"https://codeload.github.com/1st/algorithms/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1st%2Falgorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29207382,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-07T17:44:10.191Z","status":"ssl_error","status_checked_at":"2026-02-07T17:44:07.936Z","response_time":63,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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","coding-interviews","data-structures","interview","python"],"created_at":"2026-02-07T20:12:51.005Z","updated_at":"2026-02-07T20:12:51.139Z","avatar_url":"https://github.com/1st.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithms and Data Structures\n\nThis repository is a lightweight book for refreshing core concepts ahead of technical interviews. Each chapter focuses on a single idea, demonstrates it with Python, and closes with interview-ready checkpoints.\n\n## How to use this guide\n- **Warm up** with Part 01 to rebuild intuition before diving into problem drills.\n- **Refer back** to the data-structure and appendix chapters when you need a quick reminder during practice.\n- **Take notes** inside each chapter—treat this as a living workbook tailored to your learning style.\n\n## Structure\n\n### 01. Foundations of Algorithms\n- [01 · Introduction and Motivation](01.%20Foundations%20of%20Algorithms/01-introduction-and-motivation.md)\n- [02 · How Computers Execute Code](01.%20Foundations%20of%20Algorithms/02-how-computers-execute-code.md)\n- [03 · Where Algorithms Show Up](01.%20Foundations%20of%20Algorithms/03-where-algorithms-show-up.md)\n- [04 · Complexity Basics](01.%20Foundations%20of%20Algorithms/04-complexity-basics.md)\n- [05 · Math Toolkit for Algorithms](01.%20Foundations%20of%20Algorithms/05-math-toolkit.md)\n\n### 02. Core Data Structures\n- [01 · Data Structures Overview](02.%20Core%20Data%20Structures/01-overview.md)\n- Linear Structures\n  - [02 · Arrays and Dynamic Arrays](02.%20Core%20Data%20Structures/02-arrays-and-dynamic-arrays.md)\n  - [03 · Linked Lists](02.%20Core%20Data%20Structures/03-linked-lists.md)\n  - [04 · Stacks and Queues](02.%20Core%20Data%20Structures/04-stacks-and-queues.md)\n- Hash-Based Structures\n  - [05 · Hash Tables and Maps](02.%20Core%20Data%20Structures/05-hash-tables-and-maps.md)\n  - [06 · Sets and Hashing Patterns](02.%20Core%20Data%20Structures/06-sets-and-hashing-patterns.md)\n  - [07 · Hash Collision Strategies](02.%20Core%20Data%20Structures/07-hash-collision-strategies.md)\n  - [08 · Bloom Filter Primer](02.%20Core%20Data%20Structures/08-bloom-filter-primer.md)\n- Trees\n  - [09 · Binary Trees Fundamentals](02.%20Core%20Data%20Structures/09-binary-trees-fundamentals.md)\n  - [10 · Binary Search Trees](02.%20Core%20Data%20Structures/10-binary-search-trees.md)\n  - [11 · Balanced Search Trees](02.%20Core%20Data%20Structures/11-balanced-search-trees.md)\n  - [12 · Tries and Prefix Trees](02.%20Core%20Data%20Structures/12-tries-and-prefix-trees.md)\n  - [13 · B-Trees and Variants](02.%20Core%20Data%20Structures/13-b-trees-and-variants.md)\n- Graphs\n  - [14 · Graph Representations](02.%20Core%20Data%20Structures/14-graph-representations.md)\n  - [15 · Graph Traversal Patterns](02.%20Core%20Data%20Structures/15-graph-traversal-patterns.md)\n  - [16 · Weighted Graphs and Shortest Paths](02.%20Core%20Data%20Structures/16-weighted-graphs-and-shortest-paths.md)\n- Heaps \u0026 Priority Queues\n  - [17 · Binary Heaps](02.%20Core%20Data%20Structures/17-binary-heaps.md)\n  - [18 · Heap Variants and Priority Queues](02.%20Core%20Data%20Structures/18-heap-variants-and-priority-queues.md)\n- Advanced Topics\n  - [19 · Union-Find (Disjoint Set Union)](02.%20Core%20Data%20Structures/19-union-find-disjoint-set.md)\n  - [20 · Skip Lists](02.%20Core%20Data%20Structures/20-skip-lists.md)\n  - [21 · Bloom Filter Deep Dive](02.%20Core%20Data%20Structures/21-bloom-filter-deep-dive.md)\n  - [22 · LRU Caches](02.%20Core%20Data%20Structures/22-lru-caches.md)\n\n### 03. Algorithmic Techniques\n- [01 · Recursion and Backtracking](03.%20Algorithmic%20Techniques/01-recursion-and-backtracking.md)\n- [02 · Divide and Conquer](03.%20Algorithmic%20Techniques/02-divide-and-conquer.md)\n- [03 · Sorting and Searching](03.%20Algorithmic%20Techniques/03-sorting-and-searching.md)\n- [04 · Greedy Strategies](03.%20Algorithmic%20Techniques/04-greedy-strategies.md)\n- [05 · Dynamic Programming](03.%20Algorithmic%20Techniques/05-dynamic-programming.md)\n- [06 · Graph Traversal and Pathfinding](03.%20Algorithmic%20Techniques/06-graph-traversal-and-pathfinding.md)\n- [07 · Canonical Problem Walkthroughs](03.%20Algorithmic%20Techniques/07-canonical-problem-walkthroughs.md)\n- [08 · Review Checklists and Quick Guides](03.%20Algorithmic%20Techniques/08-review-checklists-and-guides.md)\n\n### 04. Interview Practice Playbook\n- [01 · Problem-Solving Frameworks and Communication](04.%20Interview%20Practice%20Playbook/01-problem-solving-frameworks.md)\n- [02 · Progressive Practice Plan](04.%20Interview%20Practice%20Playbook/02-progressive-practice-plan.md)\n- [03 · Post-Interview Retrospectives](04.%20Interview%20Practice%20Playbook/03-post-interview-retrospectives.md)\n\n_Use the playbook to prepare before, during, and after interview loops: follow the Solve→Code→Validate framework, schedule practice with the four-week plan, and record learnings with the retrospective template._\n\n### 05. Appendices\n- [01 · Glossary of Terms and Notation](05.%20Appendices/01-glossary.md)\n- [02 · Big-O Cheat Sheet](05.%20Appendices/02-big-o-cheat-sheet.md)\n- [03 · Resources and Tools](05.%20Appendices/03-resources-and-tools.md)\n\n## Contributing\nBefore adding or editing content, read [AGENTS.md](AGENTS.md) for the project layout, writing conventions, and review checklist.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F1st%2Falgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2F1st%2Falgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F1st%2Falgorithms/lists"}