Project Euler – Problem 82 Solution

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!

The problem description is here, and click here to see all my other Euler solutions in F#.

 

This is a more difficult version of problem 81, but still, as you can’t move left so we can still optimize one column at a time.

First, let’s read the input file into a 2D array:

Prob82_01

and initialize another matrix with the same size to store the minimum sum to each of the cells:

Prob82_02

In order to avoid miscalculations due to uninitialized cells (i.e. if we had initialized them with 0), I’ve initialized the cells by assuming that we have moved right all the way, hence this line:

    else matrix.[row, 0..col] |> Array.sum

which adds up all the cells to the left of, and including, the (row, col) cell.

Next, we’ll add a couple of helper functions to work out the new minimum sum to the cell at (row, col) if we had moved up, down, or right:

Prob82_03

We can now use these functions to optimize the columns one at a time.

The tricky thing here is that we might need a few passes to converge onto the true minimum sum path to each of the cells. For example, in order to work out the minimum sum at (row, col) we need to know the minimum sum at (row-1, col) and (row+1, col). But to work out the minimum sum at (row-1, col) we need to know the minimum sum at (row, col)!

So, instead, we’ll recursively try to optimize each cell in the column until it can’t be optimized anymore:

Prob82_04

At the end of the snippet above, we optimized the columns one at a time from left to right. (I could have equally included this as part of the recursive function, but it would introduce another level of nesting which is why I opted against it)

And finally, look for the minimum sum on the right-most column in the sum matrix to answer the question:

Prob82_05

This solution runs in 9ms on my laptop.

 

The source code for this solution is here.

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!