You can climb 1 or 2 steps at a time. Write ways(n) returning how many ways there are to climb n steps. It must handle n = 70 quickly.
ways(4) → 5
ways(1) → 1
Submit runs 5 tests, including hidden edge cases.
Each hint gives a little more help. Try on your own first.
Run your code to see the output here.