Fibonacci Number | Leetcode 509 | Math

preview_player
Показать описание
Time Complexity : O(n)
Space Complexity : O(1)


Please like, share and subscribe if you found the video useful. Feel free to ask in comments section if you have any doubts. :)

#DataStructuresAndAlgorithms
#LoveBabbarDSASheet
#interviewpreparation
#AyushiSharma
Fibonacci Number solution
Fibonacci Number Leetcode
Fibonacci Number C++
Fibonacci Number Java
Fibonacci Number Python

🔥🔥🔥🔥👇👇👇

Checkout the series: 🔥🔥🔥
LIKE | SHARE | SUBSCRIBE 🔥🔥😊
Рекомендации по теме
Комментарии
Автор

Hey Ayushi because of you i am understanding how to solve problems . TQSM

pavankulkarni
Автор

Time complexity will be theta(n-2)+theta(1)

AbhishekSharma-cbnb
Автор

How you became sde-2 with 1 year of professional experience ? pls tell

Автор

int fib(int a){
if(a==0)return 0;
if(a==1)return 1;
else
return fib(a-1)+fib(a-2);
}



is this a bad code?

mdmuquimakhter
Автор

Ayushi, please arrange some mike. Voice is too low.

AbhishekSharma-cbnb