class Solution:
    def climbStairs(self, n: int) -> int:

        # better way of dealing with base case
        if n == 1:
            return 1
        if n == 2:
            return 2

        dp = [0]*n
        dp[0] = 1
        dp[1] = 2

        for i in range(2, n):
            dp[i] = dp[i-1] + dp[i-2]

        return dp[-1]

class Solution:
    def climbStairs(self, n: int) -> int:

        if n == 1:
            return 1
        if n == 2:
            return 2

        n0 = 1
        n1 = 2

        for i in range(2, n):
            count = n0 + n1
            n0 = n1
            n1 = count

        return count