LeetCode: Search Insert Position

Approach 1
LeetCode: Climbing Stairs

Approach 1: recursive. f(n) = f(n-1) + f(n-2)
LeetCode: Climbing Stairs

Approach 2: dynamic programming.