Advent of Code F# – Day 17

The source code for this post (both Part 1 and Part 2) is available here and you can click here to see my solutions for the other Advent of Code challenges.

Description for today’s challenge is here.

 

Another nice and simple challenge whose solution fits nicely into 20 lines, so here goes:

day17_01

If you have been following this series of posts on this blog, then you’ll have seen something similar to this code in previous challenges already. Couple of subtle points to note here:

  • we only yield a combination if the total volume of the containers matches the total (could have done the filtering after the fact, AFAIK there’s no significant performance difference in both approaches);
  • we’re using a depth-first approach here – yield the combinations without the current container first, then only yield combinations with this container if it wouldn’t take us over the 150 litre limit

 

Part 2

The combination-finding code stays the same, we just need to filter the combos after the fact by length:

day17_02

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 the author of Production-Ready Serverless.

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.

Hire me.


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.

Get Your Copy