How to brute force a tower with blocks.
Today I am working on a summation problem made to look like building a tower out of cubic bricks. It’s fun to brute force sometimes.
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.
Lyrics out of context: I Salute You
King Pinn: I Salute You. I’m driving halfway across the country and this song is on repeat. Rest in Peace Tonderai Makoni. You were awesome.
After a few weeks off I’m back to business. This is just an update post detailing plans for the rest of the year.
Day 13: RSA Encryption
At last we finally have the great reveal, our mystery project was implementing RSA encryption in rust.
Day 12: Modular exponentiation
We build the final piece of our mystery project, a function that computes modular exponentiation. Come on in, we have large numbers.
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.