Coming back to Rust code after a bit of a hiatus with a simple problem… The Two-sum problem. Finding numbers in an array. Yay, fun.
Day 13: RSA Encryption
At last we finally have the great reveal, our mystery project was implementing RSA encryption in rust.
Day 11: Modular Multiplicative Inverse
We build another part of the mystery project by creating a function that calculates the modular multiplicative inverse of a number.
Day 10: Least Common Multiple
We continue our mystery project by calculating the Least Common Multiple. We also bump into the Euclidean algorithm along the way.
Day 9: Rust Primality Test
The first task in a new project which shall remain unnamed until it’s ready is a primality test, i.e. checking if a number is prime.
Day 8: Rust Match
I take a look at the construct I’ve been most curious about, Rust Match. I also prove beyond a doubt that it’s a Switch statement.
Day 7: Ownership in Rust
Today I take a look at the concept of Ownership in Rust. This is the magic sauce that makes Rust “memory safe” and beginner Rusticians cry.
Day 6: Disemvowel
Today we disemvowel a string. That word is beautiful and means to remove every vowel out of a string. Disemvowel it!
Day 5: Counting Bits
Today I take a break from reading and tackle the simple problem of counting bits in Rust. This is my first Rust solution.
Day 4: Rust Functions and loops
Today I’m looking at functions and loops. They are an important part of any language and deserve a closer look.