{"id":22839096,"url":"https://github.com/1git2clone/hackerrank-hw","last_synced_at":"2025-03-31T04:09:34.772Z","repository":{"id":265769510,"uuid":"889849877","full_name":"1Git2Clone/hackerrank-hw","owner":"1Git2Clone","description":"University homework assignments rewritten in rust as well as testing","archived":false,"fork":false,"pushed_at":"2024-12-08T21:15:40.000Z","size":55,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-06T08:44:42.620Z","etag":null,"topics":["binary-gcd","euclidean-algorithm","extended-gcd","gcd","greatest-common-divisor","homework","homework-exercises","lcm","least-common-multiple","modular-arithmetic","testing"],"latest_commit_sha":null,"homepage":"","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/1Git2Clone.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,"publiccode":null,"codemeta":null}},"created_at":"2024-11-17T12:04:56.000Z","updated_at":"2024-12-08T21:15:43.000Z","dependencies_parsed_at":"2025-02-06T08:40:57.209Z","dependency_job_id":"ffdffe0b-b833-4b61-8aac-7f7d1b0c5292","html_url":"https://github.com/1Git2Clone/hackerrank-hw","commit_stats":null,"previous_names":["1git2clone/hackerrank-hw"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1Git2Clone%2Fhackerrank-hw","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1Git2Clone%2Fhackerrank-hw/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1Git2Clone%2Fhackerrank-hw/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1Git2Clone%2Fhackerrank-hw/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/1Git2Clone","download_url":"https://codeload.github.com/1Git2Clone/hackerrank-hw/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246413232,"owners_count":20773053,"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":["binary-gcd","euclidean-algorithm","extended-gcd","gcd","greatest-common-divisor","homework","homework-exercises","lcm","least-common-multiple","modular-arithmetic","testing"],"created_at":"2024-12-13T00:09:55.928Z","updated_at":"2025-03-31T04:09:34.752Z","avatar_url":"https://github.com/1Git2Clone.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Hackerrank\n\n[![Build Icon]][Build Status]\u0026emsp;[![License Icon]][LICENSE]\n\n[Build Icon]: https://img.shields.io/github/actions/workflow/status/1git2clone/hackerrank-hw/ci.yml?branch=main\n[Build Status]: https://github.com/1git2clone/hackerrank-hw/actions?query=branch%3Amain\n[License Icon]: https://img.shields.io/badge/license-MIT-blue.svg\n[LICENSE]: LICENSE\n\nUniversity homework rewritten in Rust with the same testing as well.\n\n## [Homework 1](https://www.hackerrank.com/contests/citb106-f2024-hw1/challenges)\n\n\u003c!-- prettier-ignore --\u003e\n- *16/11/2024*\n\nMainly revolves around modular arithmetic,\n[gcd](https://en.wikipedia.org/wiki/Greatest_common_divisor) and\n[lcm](https://en.wikipedia.org/wiki/Least_common_multiple). The solutions\ninvolving the greatest common divisor implement the [binary GCD\nalgorithm](https://en.wikipedia.org/wiki/Binary_GCD_algorithm) (Stein's\nalgorithm) instead of the [Euclidean\nalgorithm](https://en.wikipedia.org/wiki/Euclidean_algorithm).\n\n- [x] [Task 1](https://www.hackerrank.com/contests/citb106-f2024-hw1/challenges/discrete-mathematics-and-programming-hw-1-task-1)\n      ([src](./src/hw1/task_1.rs))\n- [x] [Task 2](https://www.hackerrank.com/contests/citb106-f2024-hw1/challenges/discrete-mathematics-and-programming-hw-1-task-2)\n      ([src](./src/hw1/task_2.rs))\n- [x] [Task 3](https://www.hackerrank.com/contests/citb106-f2024-hw1/challenges/discrete-mathematics-and-programming-hw-1-task-3)\n      ([src](./src/hw1/task_3.rs))\n\n## [Homework 2](https://www.hackerrank.com/contests/citb106-f2024-hw2/challenges)\n\n\u003c!-- prettier-ignore --\u003e\n- *23/11/2024*\n\n- [x] [Task 1](https://www.hackerrank.com/contests/citb106-f2024-hw2/challenges/discrete-mathematics-and-programming-hw-2-task-1)\n      ([src](./src/hw2/task_1.rs))\n- [x] [Task 2](https://www.hackerrank.com/contests/citb106-f2024-hw2/challenges/discrete-mathematics-and-programming-hw-2-task-2)\n      ([src](./src/hw2/task_2.rs))\n- [x] [Task 3](https://www.hackerrank.com/contests/citb106-f2024-hw2/challenges/discrete-mathematics-and-programming-hw-2-task-3)\n      ([src](./src/hw2/task_3.rs))\n\n## [Homework 3](https://www.hackerrank.com/contests/citb106-f2024-hw3/challenges)\n\n\u003c!-- prettier-ignore --\u003e\n- *30/11/2024*\n\n- [x] [Task 1](https://www.hackerrank.com/contests/citb106-f2024-hw3/challenges/discrete-mathematics-and-programming-hw-3-task-1)\n      ([src](./src/hw3/task_1.rs))\n\n## [Homework 4](https://www.hackerrank.com/contests/citb106-f2024-hw4/challenges)\n\n\u003c!-- prettier-ignore --\u003e\n- *07/12/2024*\n\n- [x] [Task 1](https://www.hackerrank.com/contests/citb106-f2024-hw4/challenges/discrete-mathematics-and-programming-hw-4-task-1/problem)\n      ([src](./src/hw4/task_1.rs))\n- [x] [Task 2](https://www.hackerrank.com/contests/citb106-f2024-hw4/challenges/discrete-mathematics-and-programming-hw-4-task-2)\n      ([src](./src/hw4/task_2.rs))\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F1git2clone%2Fhackerrank-hw","html_url":"https://awesome.ecosyste.ms/projects/github.com%2F1git2clone%2Fhackerrank-hw","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F1git2clone%2Fhackerrank-hw/lists"}