Recursion: Fibonacci Numbers

  • + 0 comments

    Python - Memoization - Top down approach

    mp = {0:0, 1:1,}
    def fibonacci(n):
        # Write your code here.
        if n == 0:
            return 0
        
        if n == 1:
            return 1
        
        if n not in mp:
            mp[n] = fibonacci(n-1) + fibonacci(n-2)
        
        return mp[n]