{"id":19710467,"url":"https://github.com/abhisaphire/algorithmic-toolbox","last_synced_at":"2025-02-27T15:29:59.358Z","repository":{"id":217324382,"uuid":"265223519","full_name":"AbhiSaphire/Algorithmic-Toolbox","owner":"AbhiSaphire","description":"The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. [2020]","archived":false,"fork":false,"pushed_at":"2020-06-23T13:06:52.000Z","size":5345,"stargazers_count":2,"open_issues_count":1,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-10T14:04:59.614Z","etag":null,"topics":["2020","abhisaphire","algorithmic-toolbox","algorithms","coursera","coursera-course","divide-and-conquer","dynamic-programming","greedy-algorithms","practical-applications","space-complexity-analysis","space-time-tradeoff","time-complexity-analysis"],"latest_commit_sha":null,"homepage":"","language":"Python","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/AbhiSaphire.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}},"created_at":"2020-05-19T11:04:36.000Z","updated_at":"2020-06-23T13:06:55.000Z","dependencies_parsed_at":"2024-01-15T19:54:44.015Z","dependency_job_id":null,"html_url":"https://github.com/AbhiSaphire/Algorithmic-Toolbox","commit_stats":null,"previous_names":["abhisaphire/algorithmic-toolbox"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbhiSaphire%2FAlgorithmic-Toolbox","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbhiSaphire%2FAlgorithmic-Toolbox/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbhiSaphire%2FAlgorithmic-Toolbox/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbhiSaphire%2FAlgorithmic-Toolbox/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AbhiSaphire","download_url":"https://codeload.github.com/AbhiSaphire/Algorithmic-Toolbox/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241029227,"owners_count":19896878,"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":["2020","abhisaphire","algorithmic-toolbox","algorithms","coursera","coursera-course","divide-and-conquer","dynamic-programming","greedy-algorithms","practical-applications","space-complexity-analysis","space-time-tradeoff","time-complexity-analysis"],"created_at":"2024-11-11T22:07:27.086Z","updated_at":"2025-02-27T15:29:59.342Z","avatar_url":"https://github.com/AbhiSaphire.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithmic-Toolbox\n\u003c!-- ALL-CONTRIBUTORS-BADGE:START - Do not remove or modify this section --\u003e\n[![All Contributors](https://img.shields.io/badge/all_contributors-1-orange.svg?style=flat-square)](#contributors-)\n\u003c!-- ALL-CONTRIBUTORS-BADGE:END --\u003e\nThe course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming.\n\n## Note\nI encourage you to try and solve each problem yourself first and only then look at these solutions.\n\n## Quick Access\n### Week 1 Programming Challenges [PDF](/Week-1/week1.pdf)\n* [APlusB.cpp](/Week-1/1-APlusB.cpp)\n* [max_pairwise_product.cpp](/Week-1/2-max_pairwise_product.cpp)\n\n### Week 2 Algorithmic Warm-up [PDF](/Week-2/week2.pdf)\n* [fibonacci.py](/Week-2/1-fibonacci.py)\n* [fibonacci-last_digit.py](/Week-2/2-fibonacci_last_digit.py)\n* [gcd.py](/Week-2/3-gcd.py)\n* [lcm.py](/Week-2/4-lcm.py)\n* [fibonacci_huge.py](/Week-2/5-fibonacci_huge.py)\n* [fibonacci_sum_last_digit.py](/Week-2/5-fibonacci_huge.py)\n* [fibonacci_partial_sum.py](/Week-2/7-fibonacci_partial_sum.py)\n* [fibonacci_sum_squares.py](/Week-2/7-fibonacci_partial_sum.py)\n\n### Week 3 Greedy Algorithms [PDF](/Week-3/week3.pdf)\n* [change.py](/Week-3/1-change.py)\n* [fractional_knapsack.py](/Week-3/1-change.py)\n* [car_fueling.py](/Week-3/3-car_fueling.py)\n* [dot_product.py](/Week-3/4-dot_product.py)\n* [covering_segments.py](/Week-3/5-covering_segments.py)\n* [different_summands.py](/Week-3/6-different_summands.py)\n* [largest_number.py](/Week-3/7-largest_number.py)\n\n### Week 4 Divide and Conquer [PDF](/Week-4/week4.pdf)\n* [binary_search.py](/Week-4/binary_search.py)\n* [sorting.py](/Week-4/sorting.py)\n* [inversion.py](/Week-4/inversions.py)\n* [majority_element.py](/Week-4/majority_element.py)\n* [points_and_segments.py](/Week-4/points_and_segments.py)\n* [closest.py](/Week-4/closest.py)\n\n### Week 5 Dynamic Programming -1 [PDF](/Week-5/week5.pdf)\n* [change_dp.py](/Week-5/change_dp.py)\n* [primitive_calculator.py](/Week-5/primitive_calculator.py)\n* [edit_distance.py](/Week-5/edit_distance.py)\n* [lcs2.py](/Week-5/lcs2.py)\n* [lcs3.py](/Week-5/lcs3.py)\n\n### Week 6 Dynamic Programming -2 [PDF](/Week-6/week6.pdf)\n* [knapsack.py](/Week-6/knapsack.py)\n* [partition3.py](/Week-6/partition3.py)\n* [placing_parentheses.py](/Week-6/placing_parentheses.py)\n\n## Contributions\nAny type of legit contribution will be appreciated. Contributions may include :\n* Documentation\n* Improved algorithm implementation\n* Code cleaning\n* Code modularization\n\n## Certification [PDF](AlgorithmicToolbox.pdf)\n## Contributors ✨\n\nThanks goes to these wonderful people ([emoji key](https://allcontributors.org/docs/en/emoji-key)):\n\n\u003c!-- ALL-CONTRIBUTORS-LIST:START - Do not remove or modify this section --\u003e\n\u003c!-- prettier-ignore-start --\u003e\n\u003c!-- markdownlint-disable --\u003e\n\u003ctable\u003e\n  \u003ctr\u003e\n    \u003ctd align=\"center\"\u003e\u003ca href=\"https://abhisaphire.github.io\"\u003e\u003cimg src=\"https://avatars3.githubusercontent.com/u/43245214?v=4\" width=\"100px;\" alt=\"\"/\u003e\u003cbr /\u003e\u003csub\u003e\u003cb\u003eAbhishek Kumar\u003c/b\u003e\u003c/sub\u003e\u003c/a\u003e\u003cbr /\u003e\u003ca href=\"https://github.com/AbhiSaphire/Algorithmic-Toolbox/commits?author=AbhiSaphire\" title=\"Code\"\u003e💻\u003c/a\u003e \u003ca href=\"#content-AbhiSaphire\" title=\"Content\"\u003e🖋\u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\u003c/table\u003e\n\n\u003c!-- markdownlint-enable --\u003e\n\u003c!-- prettier-ignore-end --\u003e\n\u003c!-- ALL-CONTRIBUTORS-LIST:END --\u003e\n\nThis project follows the [all-contributors](https://github.com/all-contributors/all-contributors) specification. Contributions of any kind welcome!","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabhisaphire%2Falgorithmic-toolbox","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fabhisaphire%2Falgorithmic-toolbox","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabhisaphire%2Falgorithmic-toolbox/lists"}