xfactor-toml / rust-coding-challenges

Hackerrank Coding Challenges with Rust

Hackerrank Coding Challenges with Rust

Hackerrank has around 3 levels of difficulty: Easy, Medium(Intermediate), Hard(Advanced, Expert)

Hard

1. Matrix Rotation Algo
2. Morgan and a String
3. Bead Ornaments
4. String Similarity

Medium

1. Forming a Magic Square
2. Climbing the Leaderboard
3. Extra Long Factorials
4. Non-Divisible Subset
5. Queen's Attack II
6. The Time in Words
7. Bigger is Greater
8. 3D Surface Area
9. Bear and Steady Gene
10. Minimum Loss
11. Connected Cell in a Grid
12. Short Palindrome
13. Gena Playing Hanoi
14. Roads and Libraries
15. Journey to the Moon
16. Kruskal (MST): Really Special Subtree
17. Snakes and Ladders: The Quickest Way Up
18. BFS: Shortest Reach
19. Prim's (MST): Special Subtree
20. Larry's Array
21. Sherlock and Anagrams
22. The Coin Change Problem
23. Pairs
24. Red John is Back
25. Stock Maximize
26. The Longest Common Subsequence

Easy

1. Solve Me First
2. Simple Array Sum
3. Compare the Triplets
4. A Very Big Sum

---

Contribution Guide

1. Fork this repo, contribute and then send Pull Request.
2. Every solution should be written in Rust and involving README.md for algorithm explanation.