Consecutives 1's not allowed | Intuition + Code + Explanation | Flipkart Microsoft Must do Question 

class Solution: def countStrings(self, n): dp = [0] * (n + 1) if n==1 or n==2: return n+1 dp[1] = 2 dp[2] = 3 for i in range(3, n + 1): dp[i] = (dp[i - 1] + dp[i - 2]) % (10**9 + 7) return dp[n]

Great approach and logic .......Thanks❤❤

Thank you ma'am for sharing the observation that needed to solve the problem.

very nice logic and good explantaion

The way you keep the things so easy is just awesome❤

Whoaa, What an approach and explation. My mind blown away. How you get this approach pls share with us

It is actually nth term in fibonacci series, good video 👍

why it doesn't work if we dont module value with 1000000007?

good tutorial keep doing

If a string is ending with 0 we can attach 0 or 1 but if a string is ending with 1 with we will only attach 0 at the end ...correct me if I'm wrong

Much better than leetcode editorial 😂👍

Thanks! Clear Explanation

nice presentation to build intuition keep doing....💥💥💥💥

Hey, Nice Work! A question though - would it be possible for you to split this playlist topic wise? Like a playlist for trees and a playlist for linked lists and so on.

Wow😊 great and unique intuition

nice logic, loved it.....

Di your explaining method is similar to shradha di, love you di❤, i am understanding this question perfecty.

awesome😃

Thank you so much

what about the Memoization solution or is this not possible to solve via Memoization?

Though I did had a logic for the question but implementing it was puzzle for me. I watched only till 3:45 minutes of your video. And i passed all the test cases just in my first attempt. Glad to learn from an IITIAN.

🔥

Great explanation ✨👍

Thank you

Osm soln yr

Understood!!

Love u didi💖, you explained it very well. Wants to connect with you on Linkedin. Have Sent you request there , today.