# 70. Climbing Stairs

`Input: n = 2Output: 2Explanation: There are two ways to climb to the top.1. 1 step + 1 step2. 2 steps`
`Input: n = 3Output: 3Explanation: There are three ways to climb to the top.1. 1 step + 1 step + 1 step2. 1 step + 2 steps3. 2 steps + 1 step`
• `1 <= n <= 45`

# 198. House Robber

`Input: nums = [1,2,3,1]Output: 4Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).Total amount you can rob = 1 + 3 = 4.`
`Input: nums = [2,7,9,3,1]Output: 12Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).Total amount you can rob = 2 + 9 + 1 = 12.`
• `1 <= nums.length <= 100`
• `0 <= nums[i] <= 400`

# 120. Triangle

`Input: triangle = [,[3,4],[6,5,7],[4,1,8,3]]Output: 11Explanation: The triangle looks like:   2  3 4 6 5 74 1 8 3The minimum path sum from top to bottom is 2 + 3 + 5 + 1 = 11 (underlined above).`
`Input: triangle = [[-10]]Output: -10`
• `1 <= triangle.length <= 200`
• `triangle.length == 1`
• `triangle[i].length == triangle[i - 1].length + 1`
• `-104 <= triangle[i][j] <= 104`

--

--