Implement `climbStairs(n)` returning the number of distinct ways to climb `n` stairs taking 1 or 2 steps at a time.
+ 1 hidden test run on Submit.
Each step's count is the sum of the prior two, computed in O(n) time, O(1) space.
Run your code to see results.