Nowadays, most developer candidate will face an algorithmic based puzzle at their hiring technical interviews. One of the favorite exercise of recruiters is the Fizz Buzz exercise. The first time a colleague of mine introduce this exercise to me, I thought it was a dumb exercise. Then he showed me how to do it. And... Continue Reading →

In the two previous posts, we used open recursion to provide efficient solutions to dynamic programming problems, keeping the following aspects decoupled: The recurrence relation: the solution to our problem The memoization strategy: indexing into a vector The order in we compute the sub-solutions As a reminder, here is the open recurrence relation we based... Continue Reading →

In the previous post, we explored how we could leverage open recursion to solve a dynamic programming problem, while keeping the following aspect decoupled: The recurrence relation: the solution to our problem The memoization strategy: indexing into a vector The order in we compute the sub-solutions Today we will see how to apply this trick in... Continue Reading →