Dynamic Programming

Climbing Stairs

First Attempt

• Two choices, take 1 or 2 steps
• So use recursion, with results array and current progress
  • Made an infinite loop, couldn’t figure out stop condition