Recursive Fibonacci With Twist | Dataford Interview Questions

Find a recursive solution for the Fibonacci sequence with a twist.

Implement fib_twist(n, first, second), where the twist is that the first two terms are configurable and repeated recursive subproblems must be avoided with memoization. Return the term at zero-based index n.

Contract: n is a nonnegative integer, first and second are integers. For example, fib_twist(4, 2, 3) returns 13, and fib_twist(0, 8, 13) returns 8. Use recursion and support 0 <= n <= 900.

Constraints

0 <= n <= 900
first and second are integers
The sequence uses F(0) = first, F(1) = second, and F(k) = F(k - 1) + F(k - 2) for k >= 2
Use recursion for the sequence calculation
Avoid repeated computation of the same term

Function Signature

def fib_twist(n, first, second):

Your question is Recursive Fibonacci With Twist. 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

Find a recursive solution for the Fibonacci sequence with a twist.

Constraints

0 <= n <= 900
first and second are integers
The sequence uses F(0) = first, F(1) = second, and F(k) = F(k - 1) + F(k - 2) for k >= 2
Use recursion for the sequence calculation
Avoid repeated computation of the same term

Function Signature

def fib_twist(n, first, second):

Your question is Recursive Fibonacci With Twist. 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.