{"id":18582814,"url":"https://github.com/girafe-ai/msai-algorithms","last_synced_at":"2025-04-10T11:36:33.253Z","repository":{"id":61810315,"uuid":"301486509","full_name":"girafe-ai/msai-algorithms","owner":"girafe-ai","description":"Open course on Algorithms and Data Structures","archived":false,"fork":false,"pushed_at":"2024-12-09T18:02:38.000Z","size":28018,"stargazers_count":28,"open_issues_count":1,"forks_count":12,"subscribers_count":9,"default_branch":"master","last_synced_at":"2025-03-24T20:51:12.374Z","etag":null,"topics":["algorithms","computer-science","data-structures","data-structures-and-algorithms","python"],"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/girafe-ai.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":"2020-10-05T17:24:13.000Z","updated_at":"2024-12-30T19:47:16.000Z","dependencies_parsed_at":"2023-10-11T23:51:34.953Z","dependency_job_id":"58c0abab-6d27-464a-824a-5500196cfa5e","html_url":"https://github.com/girafe-ai/msai-algorithms","commit_stats":null,"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/girafe-ai%2Fmsai-algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/girafe-ai%2Fmsai-algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/girafe-ai%2Fmsai-algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/girafe-ai%2Fmsai-algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/girafe-ai","download_url":"https://codeload.github.com/girafe-ai/msai-algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248208689,"owners_count":21065205,"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":["algorithms","computer-science","data-structures","data-structures-and-algorithms","python"],"created_at":"2024-11-07T00:14:33.459Z","updated_at":"2025-04-10T11:36:28.216Z","avatar_url":"https://github.com/girafe-ai.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"## MSAI Fall 2024 Launch.\n\n### Semester content:\n\n[ContestID_W01]: https://contest.yandex.ru/contest/69200/?lang=en\n[ContestID_W02]: https://contest.yandex.ru/contest/69506/?lang=en\n[ContestID_W03]: https://contest.yandex.ru/contest/69814/?lang=en\n[ContestID_W04]: https://contest.yandex.ru/contest/70069/?lang=en\n[ContestID_W05]: https://contest.yandex.ru/contest/70070/?lang=en\n[ContestID_W06]: https://contest.yandex.ru/contest/70071/?lang=en\n[ContestID_W07]: https://contest.yandex.ru/contest/70072/?lang=en\n[ContestID_W08]: https://contest.yandex.ru/contest/70073/?lang=en\n[ContestID_W09]: https://contest.yandex.ru/contest/70074/?lang=en\n[ContestID_W10]: https://contest.yandex.ru/contest/70075/?lang=en\n\n[WarmUp_test_W01]: https://forms.gle/N7w3ogEbwN1dr1am8\n[WarmUp_test_W02]: https://forms.gle/q2ir9uSz9LYg5xWd7\n[WarmUp_test_W03]: https://forms.gle/rC7tCz5At9HRvNdg6\n[WarmUp_test_W04]: https://forms.gle/UPYmQsU7qKCt3FhM8\n[WarmUp_test_W05]: https://forms.gle/F6V36zU14HkvFMq5A\n[WarmUp_test_W06]: https://forms.gle/uxtkHdyrxKR8c8i56\n[WarmUp_test_W07]: https://forms.gle/EzjU2FB1hDY3QQkJA\n[WarmUp_test_W08]: https://forms.gle/ftxDfdVeZDQZB1JfA\n[WarmUp_test_W09]: https://forms.gle/g9QA4LTiZwg3Nbka7\n[WarmUp_test_W10]: https://forms.gle/aJ5chmuBhfviNn8Q8\n[WarmUp_test_W11]: https://forms.gle/AshGbamo5f7Qi8uL9\n\n[Slides_W01]: ../master/week01_sorting_algorithms/MSAI.2024.Algo.W01.slides.pdf\n[Slides_W02]: ../master/week02_binary_search/MSAI.2024.Algo.W02.slides.pdf\n[Slides_W03]: ../master/week03_basic_data_structures/MSAI.2024.Algo.W03.slides.pdf\n[Slides_W04]: ../master/week04_dynamic_programming/MSAI.2024.Algo.W04.slides.pdf\n[Slides_W05]: ../msai22_state/week05_knapsack/MSAI.2022.Algo.W05.slides.pdf\n[Slides_W06]: ../master/week06_kmp_heap/MSAI.2024.Algo.W06.slides.pdf\n[Slides_W07]: ../master/week07_dfs_bfs/MSAI.2024.Algo.W07.slides.pdf\n[Slides_W08]: ../master/week08_shortest_paths/MSAI.2024.Algo.W08.slides.pdf\n[Slides_W09]: ../master/week09_rsq_rmq/MSAI.2024.Algo.W09.slides.pdf\n[Slides_W10]: ../master/week10_hashing/MSAI.2024.Algo.W10.slides.pdf\n[Slides_W11]: ../master/week11_binary_search_tree/MSAI.2024.Algo.W11.slides.pdf\n\n| Week   | Content                | Slides               | WarmUp test             | Contest                  |     Soft Deadline      |\n|:------:|:-----------------------|:--------------------:|:-----------------------:|:------------------------:|:----------------------:|\n| 01     | Sorting algorithms     | [Slides][Slides_W01] | [Test][WarmUp_test_W01] | [Contest][ContestID_W01] | 14.10.2024 19:00 UTC+3 |\n| 02     | Binary search          | [Slides][Slides_W02] | [Test][WarmUp_test_W02] | [Contest][ContestID_W02] | 21.10.2024 19:00 UTC+3 |\n| 03     | Basic Data sturctures  | [Slides][Slides_W03] | [Test][WarmUp_test_W03] | [Contest][ContestID_W03] | 28.10.2024 19:00 UTC+3 |\n| 04     | Dynamic programming    | [Slides][Slides_W04] | [Test][WarmUp_test_W04] | [Contest][ContestID_W04] | 04.11.2024 19:00 UTC+3 |\n| 05     | Knapsack problem       | [Slides][Slides_W05] | [Test][WarmUp_test_W05] | [Contest][ContestID_W05] | 11.11.2024 19:00 UTC+3 |\n\u003c!---\n| 06     | KMP \u0026 Heap             | [Slides][Slides_W06] | [Test][WarmUp_test_W06] | [Contest][ContestID_W06] | ??.11.2024 19:00 UTC+3 |\n| 07     | DFS \u0026 BFS              | [Slides][Slides_W07] | [Test][WarmUp_test_W07] | [Contest][ContestID_W07] | ??.12.2024 19:00 UTC+3 |\n| 08     | Shortest paths         | [Slides][Slides_W08] | [Test][WarmUp_test_W08] | [Contest][ContestID_W08] | ??.12.2024 19:00 UTC+3 |\n| 09     | RSQ \u0026 RMQ              | [Slides][Slides_W09] | [Test][WarmUp_test_W09] | [Contest][ContestID_W09] | ??.12.2024 19:00 UTC+3 |\n| 10     | Hashing                | [Slides][Slides_W10] | [Test][WarmUp_test_W10] | [Contest][ContestID_W10] | ??.12.2024 19:00 UTC+3 |\n| 11     | Binary Search Tree     | [Slides][Slides_W11] | None                    | None                     | None                   |\n---\u003e\n\n\u003c!--- Strict deadline for all home assignments is 25.01.2024 20:00 GMT+3. ---\u003e\n\n\u003c!---\n### Exams:\n\nYou will have **practical** and **theoretical** exams.\n\n**Practical exam** problems and rules will be shared \u003cdate\u003e. Strict deadline for practical exam submissions is \u003cdate\u003e\n\nInformation about **theoretical exam** can be found [here](\u003clink\u003e).\n---\u003e\n\n\n### Final grade:\nFinal grade **`G`** consists of three parts:\n\n- Homework grade: **`H`** is an integer number within range [0; 10] (rules given below).\n\n- Practical exam grade: **`P`** is an integer number within range [0; 10] (rules will be provided later).\n\n- Theoretical exam grade: **`T`** is an integer number within range [0; 10] (rules will be provided later).\n\nYour final grade is:\n\u003cpre\u003e\u003cb\u003eG\u003c/b\u003e = ceil(0.6 \u003cb\u003eH\u003c/b\u003e + 0.2 \u003cb\u003eP\u003c/b\u003e + 0.2 \u003cb\u003eT\u003c/b\u003e)\u003c/pre\u003e\n\n\n### Homework grade\nHomework grade contributes the most into final grade. To increase homework grade you should solve problems from home assignments.\n\n**Formally:**\n\nHomework grade: **`H`** is an integer number within range [0; 10]:\n\u003cpre\u003e\u003cb\u003eH\u003c/b\u003e = round(hw_score / hw_maximum_score * 10)\u003c/pre\u003e\n\n`hw_score` is sum of scores for all problems in home assignment.\n\nScores for a problem:\n\n    - 1.0 if you solved the problem (got OK verdict) before soft deadline\n    \n    - 0.75 if you solved the problem (got OK verdict) after soft deadline\n    \n    - 0 otherwise\n\n`hw_maximum_score` is total number of problems in all home asignments.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgirafe-ai%2Fmsai-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgirafe-ai%2Fmsai-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgirafe-ai%2Fmsai-algorithms/lists"}