-Binary Strings With No Consecutive 1s (Fibonacci in LogN) | JAVA | C++ | GFG POTD 09 May

preview_player
Показать описание
I have tried explaining all approaches possible for today's GFG POTD question. Watch at 1.5 or 2x for a better experience

C++ and Java source code, use ctrl+f to search the question name:
Methods:
1. Recursion - O(2^n)
2. DP - Tabulation , Memoization - O(n), O(n)
3. O(n), O(1)
4. O(logN), O(ht of recursive stack)

Topics Wise
----------------------------------------------

Use code for 10% off on GFG : "AKSHAYS10"

----------------------------------------------

Hello, I am Akshay.
I am a Software Engineer at @Brillio. I have made this channel to help all ready to learn, grow, and do something big in Tech. I create content on Data Structures and Algorithms, to fine-tune the problem-solving skills that will help students and software engineers.

Happy Coding 🤝
.
.
.
Chapters
00:00 Introduction
06:32 All possible approaches
13:15 Binary Exponentiation
25:24 Code wallkthrough

LIKE | SHARE | SUBSCRIBE
#AkshayAnil #dsa #programming #gfg #gfgpotd #problemsolving #coding #softwareengineer #faang #dsa_with_akshay
Рекомендации по теме
Комментарии
Автор

thanks from the heart for this kind of teaching bhai.🙇🏻🙇🏻🙇🏻‍♂🙇🏻‍♂🙇🏻‍♀🙇🏻‍♀

razorvaquet
Автор

Best exponentiation. Makkhan ki tarah samjhaya

jaintrisisters
Автор

Sir, jab fib(n) muje (n+2)th term ki value return kar raha he, toh fib(n+2) toh (n+4)th term return karega .
why dont we call for fib(N-2) it will give us exact n

priyanshunegi