{"id":48494266,"url":"https://github.com/xfactor-toml/rust-coding-challenges","last_synced_at":"2026-04-07T11:34:51.311Z","repository":{"id":216627689,"uuid":"741740061","full_name":"xfactor-toml/rust-coding-challenges","owner":"xfactor-toml","description":"Hackerrank Coding Challenges with Rust","archived":false,"fork":false,"pushed_at":"2024-07-11T09:35:42.000Z","size":98,"stargazers_count":26,"open_issues_count":0,"forks_count":5,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-07-12T09:28:31.965Z","etag":null,"topics":["dsa-algorithm","hackerrank","rust"],"latest_commit_sha":null,"homepage":"https://www.hackerrank.com/profile/xfactor_toml","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/xfactor-toml.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-01-11T02:26:20.000Z","updated_at":"2024-07-11T09:35:46.000Z","dependencies_parsed_at":"2024-01-19T10:26:54.758Z","dependency_job_id":"a6c37002-aca9-49f8-b546-10c01fbe726d","html_url":"https://github.com/xfactor-toml/rust-coding-challenges","commit_stats":null,"previous_names":["xfactor-toml/rust-coding-challenges"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/xfactor-toml/rust-coding-challenges","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xfactor-toml%2Frust-coding-challenges","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xfactor-toml%2Frust-coding-challenges/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xfactor-toml%2Frust-coding-challenges/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xfactor-toml%2Frust-coding-challenges/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/xfactor-toml","download_url":"https://codeload.github.com/xfactor-toml/rust-coding-challenges/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xfactor-toml%2Frust-coding-challenges/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31511766,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-07T03:10:19.677Z","status":"ssl_error","status_checked_at":"2026-04-07T03:10:13.982Z","response_time":105,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5: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":["dsa-algorithm","hackerrank","rust"],"created_at":"2026-04-07T11:34:51.226Z","updated_at":"2026-04-07T11:34:51.305Z","avatar_url":"https://github.com/xfactor-toml.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Hackerrank Coding Challenges with Rust\n\n\u003e **Hackerrank has around 3 levels of difficulty: Easy, Medium(Intermediate), Hard(Advanced, Expert)**\n\n\n## Hard\n1. [Matrix Rotation Algo](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/hard/matrix-rotation-algo)\n2. [Morgan and a String](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/hard/morgan-and-string)\n3. [Bead Ornaments](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/hard/bead-ornaments)\n4. [String Similarity](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/hard/string-similarity)\n\n## Medium\n1. [Forming a Magic Square](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/magic-square-forming)\n2. [Climbing the Leaderboard](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/climbing-the-leaderboard)\n3. [Extra Long Factorials](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/extra-long-factorials)\n4. [Non-Divisible Subset](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/non-divisible-subset)\n5. [Queen's Attack II](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/queens-attack2)\n6. [The Time in Words](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/the-time-in-words)\n7. [Bigger is Greater](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/bigger-is-greater)\n8. [3D Surface Area](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/threed-surface-area)\n9. [Bear and Steady Gene](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/bear-and-steady-gene)\n10. [Minimum Loss](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/minimum-loss)\n11. [Connected Cell in a Grid](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/connected-cell-in-grid)\n12. [Short Palindrome](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/short-palindrome)\n13. [Gena Playing Hanoi](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/gena-playing-hanoi)\n14. [Roads and Libraries](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/roads-and-libraries)\n15. [Journey to the Moon](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/journey-to-moon)\n16. [Kruskal (MST): Really Special Subtree](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/really-special-subtree)\n17. [Snakes and Ladders: The Quickest Way Up](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/snakes-and-ladders)\n18. [BFS: Shortest Reach](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/shortest-reach)\n19. [Prim's (MST): Special Subtree](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/special-subtree)\n20. [Larry's Array](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/larry-array)\n21. [Sherlock and Anagrams](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/sherlock-and-anagrams)\n22. [The Coin Change Problem](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/coin-change)\n23. [Pairs](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/pairs)\n24. [Red John is Back](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/red-john-is-back)\n25. [Stock Maximize](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/stock-maximize)\n26. [The Longest Common Subsequence](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/longest-common-subsequence)\n27. [Play with words](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/play-with-words)\n28. [Knapsack](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/unbounded-knapsack)\n29. [Common Child](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/common-child)\n30. [Lego Blocks](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/lego-blocks)\n31. [Abbreviation](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/abbreviation)\n32. [Sam and Substrings](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/sam-substrings)\n\n## Easy\n1. [Solve Me First](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/easy/solve-me-first)\n2. [Simple Array Sum](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/easy/simple-array-sum)\n3. [Compare the Triplets](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/easy/compare-the-triplets)\n4. [A Very Big Sum](https://github.com/xfactor-toml/rust-coding-challenges/tree/master/easy/a-very-big-sum)\n\n---\n## Contribution Guide\n1. Fork this repo, contribute and then send Pull Request.\n2. Every solution should be written in Rust and involving README.md for algorithm explanation.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fxfactor-toml%2Frust-coding-challenges","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fxfactor-toml%2Frust-coding-challenges","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fxfactor-toml%2Frust-coding-challenges/lists"}