Fibonacci Iterative vs Recursive | Dataford Interview Questions

Washington Staffing's coding evaluation needs a function that generates the Fibonacci series up to a specified limit. Implement both iterative and recursive approaches, returning every Fibonacci value less than or equal to the limit.

Formal Specification

Implement fibonacci_series(n, approach), where n is a non-negative integer and approach is either "iterative" or "recursive". Use the Fibonacci definition F(0) = 0, F(1) = 1, and F(k) = F(k - 1) + F(k - 2). Return a list beginning with 0, containing values in ascending sequence order, and excluding values greater than n.

The recursive implementation should avoid recomputing the same sequence values through exponential branching. Raise ValueError if approach is not one of the two supported strings.

Constraints

0 <= n <= 10^9
approach is either "iterative" or "recursive"
Return all and only Fibonacci values less than or equal to n
The recursive approach must avoid exponential repeated computation

Function Signature

def fibonacci_series(n, approach):

Your question is Fibonacci Iterative vs Recursive. 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