Another common problem I see during my preparation for technical interviews is the Level Order Tree Traversal (or Breadth-First) problem. I always like to think with my F# hat on when I solve algorithm problem, so here’s an implementation in F# . Here we have a nested recursive loop function that: yields the value from the nodes …
ps. look out for all my other solutions for Advent of Code challenges here. Day 10 See details of the challenge here. The input for today’s challenge looks like this: bot 171 gives low to bot 4 and high to bot 84 bot 1 gives low to bot 117 and high to bot 81 bot 82 …
ps. look out for all my other solutions for Advent of Code challenges here. Day 9 See details of the challenge here. The input for today’s challenge is a very long string like this: (6×9)JUORKH(10×13)LNWIKDMACM(126×14)(21×8)QLKUJNVVZIQGGFCJZMPHK(2×1)ZH(59×3)(38×14)KELEPIDYLCGJUBCXACRSOCEZYXLO… First, let’s see how we’re gonna parse this input. The approach I went with is to recursively split the input …
Another tasty challenge that I ran into during my preparation for technical interviews is this seemingly simple problem from Facebook. input [2,3,1,4] output [12,8,24,6] Multiply all fields except it’s own position. Restrictions: 1. no use of division 2. complexity in O(n) The main challenge is in making the algorithm run in O(n) time. One solution I …
One interesting problem I read about as I prepare for various technical interviews is the so called Anagram Substring Search problem where it can be boiled down to the question “find all permutations of s within b“. Naturally, after all my endeavours with Project Euler and Advent of Code, I cast my mind to how I’d solve this in …
ps. look out for all my other solutions for Advent of Code challenges here. Day 8 See details of the challenge here. The input for today’s challenge looks like this: rect 1×1 rotate row y=0 by 10 rect 1×1 rotate row y=0 by 10 rect 1×1 rotate row y=0 by 5 rotate column x=43 by …
A problem that has shown up multiple times in my preparation for technical interviews is the so called Ransom Note problem. To solve this in F# is pretty simple. In the interest of efficiency I decided to use a mutable Dictionary instead of the F# Map to store the no. of times a letter appears in the …
ps. look out for all my other solutions for Advent of Code challenges here. Sorry for the delay in getting this post out today, I enjoyed some really fine Ramen with some of the lovely people I worked with at Yubl and only managed to find time to do the challenge and write this post late in the …
part 1: overview <- you’re here part 2: testing and CI/CD part 3: ops part 4: building a scalable notification system part 5: building a better recommendation system Since Yubl’s closure quite a few people have asked about the serverless architecture we ended up with and some of the things we have learnt along the …
Yubl’s road to Serverless architecture – overview Read More »
ps. look out for all my other solutions for Advent of Code challenges here. Day 6 See details of the challenge here. The input for today’s challenge looks like this: cmezkqgn nmzrgcft ydpndcps zjihhows kvptxsrx ubbvugwq … Since the only difference between the 2 parts of this challenge is how the characters in a column are …
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.