Fix a Fibonacci Coding Issue | Dataford Interview Questions

Fix a coding issue involving a Fibonacci sequence.

Asked in the Technical Round stage as a live coding and debugging prompt. Implement the corrected function using zero-based indexing: fibonacci(0) = 0, fibonacci(1) = 1, and fibonacci(n) = fibonacci(n - 1) + fibonacci(n - 2) for n > 1.

Input and Output

n is a non-negative integer. Return the nth Fibonacci number as an integer.

Constraints

0 <= n <= 1000
Return the value using zero-based indexing
The result must be exact

Function Signature

def fibonacci(n):

Your question is Fix a Fibonacci Coding Issue. 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