Hackerrank

 

University homework rewritten in Rust with the same testing as well.

Homework 1

• 16/11/2024

Mainly revolves around modular arithmetic, gcd and lcm. The solutions involving the greatest common divisor implement the binary GCD algorithm (Stein's algorithm) instead of the Euclidean algorithm.

• Task 1 (src)
• Task 2 (src)
• Task 3 (src)

Homework 2

• 23/11/2024

• Task 1 (src)

• Task 2 (src)

• Task 3 (src)

Homework 3

• 30/11/2024

• Task 1 (src)

Homework 4

• 07/12/2024

• Task 1 (src)

• Task 2 (src)