With Tail Call Optimization, recursive solutions can be implemented with O(1) space complexity.

A place to stick all my tree traversal algorithms so I don't forget them

Adding stacks to my toolbelt

Preparing for an upcoming meta interview.

An exploration in clean and maintainable code.

Given a grid, find the largest sum of all possible paths only moving down or to the right.

Given a grid, count the number of paths from the top-left to the bottom-right.

Of all the possible coin combination, return the one with the fewest coins.

My preferences and things I've found useful.

I want to say this solution is hidden by the way the problem tends to be phrased.

An exercise for my own understanding of dynamic programming.