Fibonacci Variants | Dataford Interview Questions

Fibonacci series using recursion, memoization, and tabulation.

Asked in the Technical stage.

Implement fibonacci_methods(n), which returns the nth Fibonacci number computed independently with all three techniques. Use the definition F(0) = 0, F(1) = 1, and F(n) = F(n - 1) + F(n - 2).

Input and Output

Input is a non-negative integer n. Return a three-element list in this order: [recursive_result, memoized_result, tabulated_result]. All three values must be equal.

Constraints

0 <= n <= 30
F(0) = 0 and F(1) = 1
The recursive implementation must not use memoization
Return results in recursive, memoized, tabulated order

Function Signature

def fibonacci_methods(n):

Your question is Fibonacci Variants. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem