Check out my new course Learn you some Lambda best practice for great good! and learn the best practices for performance, cost, security, resilience, observability and scalability.
Description for today’s challenge is here.
It’s the last day of the advent calendar, and today’s challenge appears difficult at first but mostly because of the grid system it imposes upon you.
But after some thought, the problem can be drastically simplified.
Given this grid system:
we can work out the one-based index for row N, column 1 in this formula:
F N = F(N-1) + (N-1) where F 1 = 1, F 2 = 2
F 2 = 2,
F 3 = F 2 + (3 – 1) = 2 + 2 = 4
F 4 = F 3 + (4 – 1) = 4 + 3 = 7
From here, column M is (M – 1) distance away from the first element on the same row and (M – 1) distance away from the row N that marks the start of the diagonal:
So, the one-based index for row N, column M can be expressed in terms of the F function above:
G (M, N) = F (N + M – 1) + (M – 1)
G (3, 2) = F (2 + 3 – 1) + (3 – 1) = F 4 + 2 = 7 + 2 = 9
G (6, 1) = F (1 + 6 – 1) + (6 – 1) = F 6 + 5 = 16 + 5 = 21
So for my puzzle input of row 2981, column 3075, it translates = G (3075, 2981)th element where the first element is 20151125.
Taking all these into account, and translating G (M, N) into an (x, y) based system, we can have the following to solve today’s challenge:
Pretty straightforward, right? Well, the only caveat is how we implemented F here, this is only because I wanted the implementation to be tail recursive, otherwise it can be simple as:
let F = function | 1 -> 1 | 2 -> 2 | n -> F (n-1) + (n-1)
So that’s it folks! We’ve completed all the Advent of Code challenges for 2015, and our F# xmas tree is up and running in all its glory
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 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!
Are you working with Serverless and looking for expert training to level-up your skills? Or are you looking for a solid foundation to start from? Look no further, register for my Production-Ready Serverless workshop to learn how to build production-grade Serverless applications!
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 wrong about serverless and vendor lock-in
- You are thinking about serverless costs all wrong
- Just how expensive is the full AWS SDK?
- Many faced threats to Serverless security
- We can do better than percentile latencies
- 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
- Top 10 Serverless framework best practices