ps. look out for all my other solutions for Advent of Code challenges here.
See details of the challenge here.
The input for today’s challenge is a very long string like this:
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.
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
(3×3)XYZ still becomes XYZXYZXYZ, as the decompressed section contains no
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
(25×3)(3×3)ABC(2×3)XY(5×2)PQRSTX(18×9)(3×2)TWO(5×7)SEVEN becomes 445 characters
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
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.
- Day 9 challenge description
- Advent of Code 2015
- Solution for Day 8
- All my F# solutions for Advent of Code
- Github repo
I specialise in rapidly transitioning teams to serverless and building production-ready services on AWS.
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.
Check out my new 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. Including basic concepts, HTTP and event triggers, activities, callbacks, nested workflows, design patterns and best practices.
Here is a complete list of all my posts on serverless and AWS Lambda. In the meantime, here are a few of my most popular blog posts.
- Lambda optimization tip – enable HTTP keep-alive
- You are thinking about serverless costs all wrong
- Many faced threats to Serverless security
- We can do better than percentile latencies
- I’m afraid you’re thinking about AWS Lambda cold starts all wrong
- Yubl’s road to Serverless
- AWS Lambda – should you have few monolithic functions or many single-purposed functions?
- AWS Lambda – compare coldstart time with different languages, memory and code sizes
- Guys, we’re doing pagination wrong