ps. look out for all my other solutions for Advent of Code challenges here. Day 19 See details of the challenge here. I initially approached today’s challenge as a dynamic programming exercise, but it quickly transpired that there’s a much better way to do it once I realised that part 1 is in fact the …
ps. look out for all my other solutions for Advent of Code challenges here. Day 18 See details of the challenge here. To solve both part 1 and 2: Links Day 18 challenge description Advent of Code 2015 Solution for Day 17 All my F# solutions for Advent of Code Github repo
ps. look out for all my other solutions for Advent of Code challenges here. Day 17 See details of the challenge here. First, let’s add a hash function (that returns the MD5 as a hexadecimal string as we have done so often this year). Then, add a step function that’ll take a (x, y) position and the path …
ps. look out for all my other solutions for Advent of Code challenges here. Day 16 See details of the challenge here. I also tried an implememtation using string instead of bool[] and there is no distinguishable difference in terms of performance. Now that we have the solve function we can answer both part 1 …
ps. look out for all my other solutions for Advent of Code challenges here. Day 15 See details of the challenge here. Today’s challenge is pretty straight forward, and a brute force approach would have suffice – try every t from 0 to inifinity and return the first t that satisfies this equation for all …
ps. look out for all my other solutions for Advent of Code challenges here. Day 14 See details of the challenge here. Today’s challenge is very similar to that of Day 5, but the requirements for a valid hash value is different this time. As before, we’ll start by defining a hash function that will accept a string and return …
ps. look out for all my other solutions for Advent of Code challenges here. Day 13 See details of the challenge here. Today’s challenge involves solving two separate problems: counting set bits in an integer level order tree traversal For the first problem, I recommend reading through this blog post which covers several approaches and optimizations for this …
A good friend pointed me to a nice coding challenge she encountered – finding the Equilibrium Index of an array in O(n) time. After a quick discussion we ended up with 2 solutions, and naturally I had to code them up in F# Solution 1 This is the same approach to the one you saw in …
ps. look out for all my other solutions for Advent of Code challenges here. Day 12 See details of the challenge here. The input for today’s challenge looks like this: cpy 1 a cpy 1 b cpy 26 d jnz c 2 jnz 1 5 cpy 7 c … This is very similar to Day 23 …
ps. look out for all my other solutions for Advent of Code challenges here. Day 11 See details of the challenge here. Today is perhaps the first AOC challenge that is really challenging and required a lot of thought, and I really enjoyed it! First, let’s model the problem domain. and we’ll need a way to …
By continuing to use the site, you agree to the use of cookies. more information
The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.