climbing_stairs 

 1from functools import lru_cache
 2
 3
 4# @leet start
 5class Solution:
 6    def climbStairs(self, n: int) -> int:
 7        """
 8        This question is just fibonacci.
 9        """
10
11        @lru_cache
12        def recurse(n):
13            if n < 2:
14                return 1
15            return recurse(n - 1) + recurse(n - 2)
16
17        return recurse(n)
18
19
20# @leet end
21
22
23def test():
24    assert 2 + 2 == 4
class Solution: 
 6class Solution:
 7    def climbStairs(self, n: int) -> int:
 8        """
 9        This question is just fibonacci.
10        """
11
12        @lru_cache
13        def recurse(n):
14            if n < 2:
15                return 1
16            return recurse(n - 1) + recurse(n - 2)
17
18        return recurse(n)
def climbStairs(self, n: int) -> int: 
 7    def climbStairs(self, n: int) -> int:
 8        """
 9        This question is just fibonacci.
10        """
11
12        @lru_cache
13        def recurse(n):
14            if n < 2:
15                return 1
16            return recurse(n - 1) + recurse(n - 2)
17
18        return recurse(n)

This question is just fibonacci.

def test(): 
24def test():
25    assert 2 + 2 == 4