{"id":34874260,"url":"https://github.com/manuindersekhon/algorithms-specialization-stanford","last_synced_at":"2026-05-26T05:02:40.681Z","repository":{"id":131126226,"uuid":"456234845","full_name":"manuindersekhon/algorithms-specialization-stanford","owner":"manuindersekhon","description":"Solutions for problems sets and algorithms taught in Stanford's Algorithms Specialization at Coursera.","archived":false,"fork":false,"pushed_at":"2022-07-09T19:34:20.000Z","size":48975,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-03-22T12:29:26.670Z","etag":null,"topics":["algorithms","coursera","divide-and-conquer","graph-algorithms","greedy-algorithms","npcomplete","rust","specialization"],"latest_commit_sha":null,"homepage":"","language":"Rust","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/manuindersekhon.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}},"created_at":"2022-02-06T18:22:46.000Z","updated_at":"2024-03-22T12:29:27.512Z","dependencies_parsed_at":"2023-06-03T19:30:40.832Z","dependency_job_id":null,"html_url":"https://github.com/manuindersekhon/algorithms-specialization-stanford","commit_stats":null,"previous_names":["manuindersekhon/algorithms-specialization-stanford"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/manuindersekhon/algorithms-specialization-stanford","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/manuindersekhon%2Falgorithms-specialization-stanford","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/manuindersekhon%2Falgorithms-specialization-stanford/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/manuindersekhon%2Falgorithms-specialization-stanford/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/manuindersekhon%2Falgorithms-specialization-stanford/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/manuindersekhon","download_url":"https://codeload.github.com/manuindersekhon/algorithms-specialization-stanford/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/manuindersekhon%2Falgorithms-specialization-stanford/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33504806,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T03:12:49.672Z","status":"ssl_error","status_checked_at":"2026-05-26T03:12:47.976Z","response_time":63,"last_error":"SSL_read: 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","coursera","divide-and-conquer","graph-algorithms","greedy-algorithms","npcomplete","rust","specialization"],"created_at":"2025-12-26T00:36:05.411Z","updated_at":"2026-05-26T05:02:40.674Z","avatar_url":"https://github.com/manuindersekhon.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Stanford's Algorithms Specialization\n\nThis repository contains the solutions for problems sets and algorithms taught in [Stanford's Algorithms Specialization](https://www.coursera.org/specializations/algorithms) at Coursera.\n\nMost of the problems sets are written in `Rust` (as a part of learning Rust itself) and some of them are written in `C++` and `Dart`.\n\n### Topics and Design paradigms covered are:\n\n1. [Divide and Conquer, Sorting and Searching, and Randomized Algorithms](https://github.com/ManuSekhon/algorithms-specialization-stanford/tree/main/1.%20Divide%20and%20Conquer%2C%20Sorting%20and%20Searching%2C%20and%20Randomized%20Algorithms)\n1. [Graph Search, Shortest Paths, and Data Structures](https://github.com/ManuSekhon/algorithms-specialization-stanford/tree/main/2.%20Graph%20Search%2C%20Shortest%20Paths%2C%20and%20Data%20Structures)\n1. [Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming](https://github.com/ManuSekhon/algorithms-specialization-stanford/tree/main/3.%20Greedy%20Algorithms%2C%20Minimum%20Spanning%20Trees%2C%20and%20Dynamic%20Programming)\n1. [Shortest Paths Revisited, NP Complete Problems and What to Do about It](https://github.com/ManuSekhon/algorithms-specialization-stanford/tree/main/4.%20Shortest%20Paths%20Revisited%2C%20NP%20Complete%20Problems%20and%20What%20to%20Do%20about%20It)\n\nSpecific details are covered in each subfolder.\n\n### Running the files\n\nProblem sets are tested on below versions at the time of writing.\n\nRust: `rustc 1.60.0 (7737e0b5c 2022-04-04)`\n\nDart: `2.17.3 (stable)`\n\nC++: `Apple clang version 13.1.6 (clang-1316.0.21.2.5)`\n\nFiles can be compiled and run by following the below steps.\n\n```bash\n# Rust\n$ rustc -C debuginfo=0 -C opt-level=3 filename.rs\n$ ./filename\n\n# Dart single file.\n$ dart --enable-asserts filename.dart\n\n# Dart project\n$ dart run\n\n# C++\n$ clang++ -Wall -Werror -Wno-unused-parameter -std=c++17 filename.cpp -o filename\n$ ./filename\n```\n\n\nI will try to cover optional problems and later more techniques like linear programming, online algorithms, etc.\n\n***\n*Manuinder  Sekhon*","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmanuindersekhon%2Falgorithms-specialization-stanford","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmanuindersekhon%2Falgorithms-specialization-stanford","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmanuindersekhon%2Falgorithms-specialization-stanford/lists"}