Fibonacci Number
Updated
Problem statement
Return the Fibonacci number F(n), where F(0) = 0, F(1) = 1, and F(n) = F(n - 1) + F(n - 2) for n >= 2.
Practice both a recursive solution and a dynamic-programming solution. The editorial shows memoized recursion and an iterative solution using the same recurrence.
Function
fibonacci(n: int) → intExamples
Example 1
n = 5return = 5The sequence from index 0 through 5 is 0, 1, 1, 2, 3, 5.
Example 2
n = 0return = 0The base definition gives F(0) = 0.
Constraints
0 <= n <= 45
More JP Morgan Chase Onsite Interview questions
- LFU CacheONSITE INTERVIEW · Seen Nov 2026
- LRU CacheONSITE INTERVIEW · Seen Nov 2026
- Employees Above Average SalaryONSITE INTERVIEW · Seen Sep 2026
- Highest-Earning Employees By DepartmentONSITE INTERVIEW · Seen Sep 2026
- K Largest Integers in Descending OrderONSITE INTERVIEW · Seen Aug 2026
- Tile a Three-Row Board with DominoesONSITE INTERVIEW · Seen Jan 2026
- Two SumONSITE INTERVIEW · Seen Nov 2025
- Intersection of Two ListsONSITE INTERVIEW · Seen Jan 2025
- Maximum Subarray SumONSITE INTERVIEW · Seen Jan 2025
- Integrate a Sampled FunctionONSITE INTERVIEW · Seen Nov 2024
Similar questions at other companies
- Fibonacci with Input ValidationMorgan Stanley · ONSITE INTERVIEWMorgan Stanley interview questions
- Count Complete Tic-Tac-Toe GamesDecagon · PHONE SCREEN · ONSITE INTERVIEWDecagon interview questions
- Scramble StringExpedia · ONSITE INTERVIEWExpedia interview questions
- Validate a Palindrome After Limited DeletionsMeta · PHONE SCREEN · ONSITE INTERVIEWMeta interview questions
- Binary Tree Maximum Path SumGoldman Sachs · ONSITE INTERVIEWGoldman Sachs interview questions
- Recursive Task Worker with MemoizationCitadel · ONSITE INTERVIEWCitadel interview questions
- Wildcard Pattern MatchingMicrosoft · ONSITE INTERVIEWMicrosoft interview questions
- Every Result of Grouping an ExpressionC3.ai · ONSITE INTERVIEWC3.ai interview questions
- Maximum Subarray SumStraive · OA
- Edit DistanceAstrotalk · PHONE SCREEN