Explore >> Select a destination
|
You are here 
|
zverok.space | ||
| | | | |
mfbmina.dev
|
|
| | | | | Caesar cipher is the simplest and most widely known encryption technique. It is also known as Caesar's cipher, shift cipher, Caesar's code, Caesar shift, or ROT N (ROT13 is the most famous one, shifting letters by 13). It is very simple because it just works for letters between A and Z, ignoring all special characters, such as dots, whitespaces, question marks, and special letters, like Ç or Á. Starting our implementation, we need to create a class that will know what we want to cipher and how many rotat... | |
| | | | |
brendanbondurant.com
|
|
| | | | | A month or two ago (I think? between kids and Turing I have no sense of time) one of our technical practice problems was figuring out how to implement the Sieve of Eratosthenes. I got kind of obsessed over that weekend trying to figure out a more efficient way to do it than what I... | |
| | | | |
weblog.raganwald.com
|
|
| | | | | ||
| | | | |
blog.drewolson.org
|
|
| | | Delving into the world of pure functional programming caused me to learn about parser combinators. Upon returning to Elixir, I was excited to see that nimble_parsec is a great example of a parser combinator library for the Elixir ecosystem. Parser combinators can be notoriously confusing when first learned. In this post I'll provide a gentle introduction to parser combinators via nimble_parsec. What is a Parser Combinator? Have you ever found yourself writing a regular expression to parse input? I know I have. You finally have the syntax correct and then new requirements get added. Suddenly you need to support optional tokens, lists of values and other complicated types of input. When regular expressions start to break down because of complexity, it's time t... | ||
