Dynamic Programming, Programming, Algorithms, Data, Coding Interviews.
climb(2) = 2. This looks similar to recurrence relation of the Fibonacci series so we can apply the idea of dynamic programming. Counting problems Example 1: Count paths from the top left to the bottom right of an MxN matrix You have given an NxM grid, and you are at the starting point i.e. 1st row