?? Day 3: Fibonacci Number
Disha Khanpara
Business Development Executive @Awarefluence | Frontend Developer & UX/UI Enthusiast | Data Analyst (SQL, Power BI, Python) | Book Reviewer | Passionate About Data & Design
?? Problem Statement:
The Fibonacci numbers, commonly denoted F(n), form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,
Given n, calculate F(n).
Example 1:
Input: n = 2 - Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.
Example 2:
Input: n = 3 - Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.
Example 3:
Input: n = 4 - Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.
? Like, Share, Comment, Feedback & Subscribe for More! Feel free to share your thoughts and follow along with the challenge. Let’s learn and improve together!
?? #100DaysLeetCode #LeetCodeChallenge #Python #PythonCoding #DSA #ProblemSolving #CodingJourney #Disha100DaysChallenge
Ex-ipleaders || Trying to tell Stories|| Learning Content Creation|| Budding Lawyer ||
4 周nice explanation of Fibonacci ?