Thank you, the explanation was amazing!!!! I just have one request, please don’t clean the board with your fingers/hands, the ink is not good for your skin. Take care!
bhai ye code wrong dekha raha hai gfg pe!! def numberOfWays(self, N): # code here if N == 0: return 0 if N == 1: return 1 first, second = 0, 1 temp = 0
for i in range(N): temp = first + second first = second second = temp
Thanks bhYA for Helpings && Supporting Us.❤️❤️ Literally,You are Legend.
when you first solved these kinds of the question how you think of the approach -> I think Lots of practice 😅(Nice Approach)
You explained it by so perfectly that how this problem gets converted to fibonacci ♥♥
Thanx bhaiya bas aap aise hi depth se bhout se ques kara do🙏🙏
Great Explanation.
GREAT EXPLANATION ❤️❤️
kya sahi explain kiya hai bhai!!!
New look
Looks to bahut badli hai 😂
Thank you, the explanation was amazing!!!! I just have one request, please don’t clean the board with your fingers/hands, the ink is not good for your skin. Take care!
Nice video
Nice
bhai ye code wrong dekha raha hai gfg pe!!
def numberOfWays(self, N):
# code here
if N == 0:
return 0
if N == 1:
return 1
first, second = 0, 1
temp = 0
for i in range(N):
temp = first + second
first = second
second = temp
return temp
This is because you have to return the ans %1000000007.
Nice.