We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 78a3159 commit 47055d6Copy full SHA for 47055d6
main.py
@@ -18,7 +18,7 @@ def nth_fibonacci_util(n, memo):
18
19
# Base case: if n is 0 or 1, return n
20
if n <= 1:
21
- return n
+ return m
22
23
# Check if the result is already in the memo table
24
if memo[n] != -1:
0 commit comments