Advent of Code F# – Day 9

You can become a serverless blackbelt. Enrol to my 4-week online workshop Production-Ready Serverless and gain hands-on experience building something from scratch using serverless technologies. At the end of the workshop, you should have a broader view of the challenges you will face as your serverless architecture matures and expands. You should also have a firm grasp on when serverless is a good fit for your system as well as common pitfalls you need to avoid. Sign up now and get 15% discount with the code yanprs15!

ps. look out for all my other solutions for Advent of Code challenges here.

 

Day 9

See details of the challenge here.

The input for today’s challenge is a very long string like this:

(6×9)JUORKH(10×13)LNWIKDMACM(126×14)(21×8)QLKUJNVVZIQGGFCJZMPHK(2×1)ZH(59×3)(38×14)KELEPIDYLCGJUBCXACRSOCEZYXLO…

First, let’s see how we’re gonna parse this input.

The approach I went with is to recursively split the input with input.Split([| ‘(‘; ‘)’ |], 3) which will return either:

  • the whole string if there’s no (n x count) section, eg. “ADVENT” => “ADVENT”
  • or an array of 3 elements
    • for “X(1×3)YZUVW”, it’ll return [| “X”; “1×3”; “YZUVW” |]
    • for “(1×3)YZUVW”, it’ll return [| “”; “1×3”; “YZUVW” |]

To parse the number of characters (n) and number of times to repeat (count) from “1×3” we can introduce an active pattern (the Repeat pattern below) to do the job.

Now we can recursively split the string and count the length of the decompressed string.

 

Part 2

Apparently, the file actually uses version two of the format.

In version two, the only difference is that markers within decompressed data are
decompressed. This, the documentation explains, provides much more substantial
compression capabilities, allowing many-gigabyte files to be stored in only a
few kilobytes.

For example:

(3×3)XYZ still becomes XYZXYZXYZ, as the decompressed section contains no
markers.
X(8×2)(3×3)ABCY becomes XABCABCABCABCABCABCY, because the decompressed data from
the (8×2) marker is then further decompressed, thus triggering the (3×3) marker
twice for a total of six ABC sequences.
(27×12)(20×12)(13×14)(7×10)(1×12)A decompresses into a string of A repeated
241920 times.
(25×3)(3×3)ABC(2×3)XY(5×2)PQRSTX(18×9)(3×2)TWO(5×7)SEVEN becomes 445 characters
long.
Unfortunately, the computer you brought probably doesn’t have enough memory to
actually decompress the file; you’ll have to come up with another way to get its
decompressed length.

What is the decompressed length of the file using this improved format?

Part 2 requires slightly more work and, as the challenge hinted, we might overflow on int so let’s use int64 instead.

The main difference to part 1 is that we need to make the decompressV2 function itself recursive, and call into it from inside the loop function to work out the decompressed length of the repeated section.

 

Links

Liked this article? Support me on Patreon and get direct help from me via a private Slack channel or 1-2-1 mentoring.
Subscribe to my newsletter


Hi, I’m Yan. I’m an AWS Serverless Hero and I help companies go faster for less by adopting serverless technologies successfully.

Are you struggling with serverless or need guidance on best practices? Do you want someone to review your architecture and help you avoid costly mistakes down the line? Whatever the case, I’m here to help.

Hire me.


Skill up your serverless game with this hands-on workshop.

My 4-week Production-Ready Serverless online workshop is back!

This course takes you through building a production-ready serverless web application from testing, deployment, security, all the way through to observability. The motivation for this course is to give you hands-on experience building something with serverless technologies while giving you a broader view of the challenges you will face as the architecture matures and expands.

We will start at the basics and give you a firm introduction to Lambda and all the relevant concepts and service features (including the latest announcements in 2020). And then gradually ramping up and cover a wide array of topics such as API security, testing strategies, CI/CD, secret management, and operational best practices for monitoring and troubleshooting.

If you enrol now you can also get 15% OFF with the promo code “yanprs15”.

Enrol now and SAVE 15%.


Check out my new podcast Real-World Serverless where I talk with engineers who are building amazing things with serverless technologies and discuss the real-world use cases and challenges they face. If you’re interested in what people are actually doing with serverless and what it’s really like to be working with serverless day-to-day, then this is the podcast for you.


Check out my new course, Learn you some Lambda best practice for great good! In this course, you will learn best practices for working with AWS Lambda in terms of performance, cost, security, scalability, resilience and observability. We will also cover latest features from re:Invent 2019 such as Provisioned Concurrency and Lambda Destinations. Enrol now and start learning!


Check out my video course, Complete Guide to AWS Step Functions. In this course, we’ll cover everything you need to know to use AWS Step Functions service effectively. There is something for everyone from beginners to more advanced users looking for design patterns and best practices. Enrol now and start learning!