Available question text
Compute F(n) defined by F(0)=0, F(1)=1 and F(n)=F(n-1)+F(n-2); return the nth Fibonacci number for 0 ≤ n ≤ 30. The task tests handling a simple linear recurrence efficiently (iterative or memoized DP rather than naive exponential recursion).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Bloomberg
Leetcode 509. Fibonacci Number
Reported Jul 17, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source