Тёмный

Fibonacci Number | Leetcode 509 | Math 

Ayushi Sharma
Подписаться 40 тыс.
Просмотров 4,3 тыс.
50% 1

Time Complexity : O(n)
Space Complexity : O(1)
Problem Link : leetcode.com/problems/fibonac...
C++ Code Link : github.com/Ayu-99/Data-Struct...
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
🔥🔥🔥🔥👇👇👇
Join telegram channel for more updates on placement preparation : t.me/AyushiSharmaDiscussionGroup
Checkout the series: 🔥🔥🔥
👉Interview Experiences : • Interview Experiences
👉 Array: • Arrays
👉 Linked List : • Linked List
👉 Heap : • Heap
👉 Recursion : • Recursion
👉 Stack and Queue : • Stack And Queue
👉 Greedy : • Greedy
👉 Dynamic Programming : • Dynamic Programming
👉 Leetcode contests : • Leetcode contests
👉 Leetcode June Challenge : • Leetcode June Challenge
👉 Leetcode July Challenge : • Leetcode July Challenge
LIKE | SHARE | SUBSCRIBE 🔥🔥😊

Опубликовано:

 

5 июл 2022

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 15   
@Arora-Sir
@Arora-Sir 2 года назад
Kya mast video banayi hai
@pavankulkarni6007
@pavankulkarni6007 2 года назад
Hey Ayushi because of you i am understanding how to solve problems . TQSM
@AyushiSharmaDSA
@AyushiSharmaDSA 2 года назад
You’re welcome Pavan, glad they are helpful Thank you so much 🤗
@AbhishekSharma-cb8nb
@AbhishekSharma-cb8nb 2 года назад
Time complexity will be theta(n-2)+theta(1)
@adil470
@adil470 Год назад
Thank you so much🙌🙌
@AyushiSharmaDSA
@AyushiSharmaDSA Год назад
Welcome 🤗
@ashjournal
@ashjournal 2 года назад
👍👍👍
@Anand__Yadav
@Anand__Yadav 2 года назад
We can do samee by recursion also..
@sssumeet
@sssumeet 2 года назад
for Recursive Time complexity: O(2^n) Space complexity: O(n)
@AyushiSharmaDSA
@AyushiSharmaDSA 2 года назад
Yes
@bshkjiffy
@bshkjiffy Год назад
@@sssumeet then we can use memoization to decrease time complexity to O(n)
@mdmuquimakhter5145
@mdmuquimakhter5145 2 года назад
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?
@AbhishekSharma-cb8nb
@AbhishekSharma-cb8nb 2 года назад
Ayushi, please arrange some mike. Voice is too low.
@AyushiSharmaDSA
@AyushiSharmaDSA 2 года назад
Hey Abhishek, for me the voice is fine . Are you using earphones?
@AbhishekSharma-cb8nb
@AbhishekSharma-cb8nb 2 года назад
Using earphone and with the full volume I'm able to listen. Can not you please arrange a mike for your precious audience? Still I'm not earning well else I would have given one to you consider the way you are helping us.
Далее
Recursion for Beginners - Fibonacci Numbers
10:16
Просмотров 21 тыс.
English Conversation 39 | Funny English
30:47
Просмотров 2,7 млн