We build another part of the mystery project by creating a function that calculates the modular multiplicative inverse of a number.
We continue our mystery project by calculating the Least Common Multiple. We also bump into the Euclidean algorithm along the way.
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.
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.
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.
Today we disemvowel a string. That word is beautiful and means to remove every vowel out of a string. Disemvowel it!
Today I take a break from reading and tackle the simple problem of counting bits in Rust. This is my first Rust solution.
Today I’m looking at functions and loops. They are an important part of any language and deserve a closer look.
Today I take a look at Rust variables and data types. It’s a gentle introduction to a language not too alien from JavaScript.
Today I take a look at cargo, Rust’s answer to npm and yarn. It’s a tool that makes a developer’s life that much easier.