Count Ways To Build Good Strings | BOTTOM UP | META | Leetcode-2466 | Live Code + Explanation

[@JJ-tp2dd]

Just unbelievable bhai..magical ♥💙 . Java implementation: class Solution { public int countGoodStrings(int low, int high, int zero, int one) { int mod = 1000000007; //t[i] == number of good strings of length i int [] t = new int[high+1]; t[0] = 1; // "" for(int i=1; i= 0) t[i] = (t[i]%mod + t[i-zero]%mod)%mod; if(i-one >=0) t[i] = (t[i]%mod + t[i-one]%mod)%mod; } int ans = 0; for(int l=low; l

[@codestorywithMIK]

❤️❤️

[@Your_Boy_Suraj]

Bhai Jaisa Graph Series ko Scratch se padhaya waise hi please ek Tree series bhi bana do na and Ryan ki baate include karna bilkul mat bhulna, usse energy level maintain rehta hai!! Thank you for the Graph series... Kaafi underrated content hai and ye channel bhi❤

[@codestorywithMIK]

Sure Suraj Thank you so much for watching ❤️❤️❤️

[@JJ-tp2dd]

really looking forward to your dp concepts series. Ek suggestion/request h.. Jb ap concepts smjhaoge dp series me and then us concept pe question karaoge toh please 9-10 similar pattern k question link kr dena ya question no comment me dena so that practice ho paye..🥺🥺

[@codestorywithMIK]

Sure thing ❤️❤️

[@sanjaykatta6499]

Bro, will there be a situation where the interviewer specifically asks for bottom up approach? Is this just to know another approach apart from top down and or does this have any added advantage? Because somehow I feel top down approach is more intuitive than the bottom up.

[@sunnyvlogs__]

Bhaiya In interviews Top-down (recur+memo) is sufficient or we need to practice Bottom up as well?

[@codestorywithMIK]

Bottom up has been increasingly become important for interviews of Top tech companies.

[@sanjaykatta6499]

For Viewers - switch to 1.5x for better experience!

[@codestorywithMIK]

Thank you ❤️😇🙏

[@YashMalav-kh1ov]

Bhaiya jbb ham t[0] = 1 le rhe hai means zero length kitni good strings to it show have followed naa ki uski len mtlb zero low aur high ke bich ho tbb hi apn t[0] kr skte hai??

[@ManojKrVerma-vw4dx]

First if case mei rvalue mei t[i] ki need kya hain?

[@codestorywithMIK]

you can skip it since it’s the first if condition.

[@venkatarohitpotnuru38]

Supper

[@satyamkumaryadav1560]

sir i have one simple doubt aap empty string ko as a good string count kr rahe jaise t[0]=1 toh t[1]=2 hona chaiye us logic se please clear this doubt

[@codestorywithMIK]

Actually if you remember I told that if we set t[0] = 1 Then whole array will be 0 till the end. Sometimes there are questions where we do something like this. One similar Qn is Minumum Subset Sum in DP bottom up. I will be starting DP concepts playlist where I will be teaching all these things too

[@satyamkumaryadav1560]

@@codestorywithMIK sir please start asap in 2-3 months we will be having our placement month so it will be very kind of you if you start soon , because there are small concepts like this which we lack and are unable to solve problems

[@codestorywithMIK]

Sure thing ❤️❤️

[@yashgarg3027]

Bhaiya plz 1 request next aaj 1 video upload kr do on today biweekly leetcode contest 3 question maximum xor

[@codestorywithMIK]

Hi Yash, Actually i am spending most of my time today with my mom celebrating Mother’s. I will definitely come up with the video soon for that. Thank you for trusting my channel and the patience ❤️❤️

[@souravjoshi2293]

L.E.G.E.N.D

[@codeandtalk6]

❤

[@wearevacationuncoverers]

Dude, when do you rest ? Weekends (I don't think so)

[@ManojKrVerma-vw4dx]

Coders never rest. Its a habit not compulsion

[@souravjoshi2293]

@@ManojKrVerma-vw4dx True

[@Brute_Coder]

can anyone help me to debug this code ?? class Solution { int mod = 1000000007; public int countGoodStrings(int low, int high, int zero, int one) { int[] dp = new int[high+1]; Arrays.fill(dp,0); dp[0] = 1; for(int i = 1;i= 0) ? dp[i-zero] : 0; int foro = ((i-one) >= 0) ? dp[i-one] : 0; dp[i] = forz%mod + foro%mod; } int ans = 0 ; for(int i = low ;i

[@unknown47896]

ask chatgpt