2466. Count Ways To Build Good Strings | leetcode daily challenge | dsa | shashcode

[@mituldwivedi4469]

that's why i watch shashwat
recurstion -> memoization -> tabulation
the flow was perfect.
keep it up bro... i need you.

[@shashwat_tiwari_st]

😄😄 Glad you liked the flow!

[@shashwat_tiwari_st]

like target is 150. Please do and comment if you were able to understand the code as well as the explanation😄😄

[@bhushanambhore8378]

Thanks for the explanation. I need to go through more on tabulation as i dont know what it is and how it works..

[@kotankarnarendrateja341]

Hi Bhayya,
I hope you are doing well.
In DSA, we deal with so many concepts, and sometimes it can be challenging to remember and analyze them effectively, especially when applying them to real-time use cases.
Could you please create a video explaining how to approach this systematically? It would be really helpful to understand how to retain the concepts and apply them in practical scenarios.
Looking forward to your insights!

[@DarkDragon-bz6qp]

Thanks a lot..Maximum jagah pe tabulation aur memoization pe ka koi link nahi hai ..out of no where direct tabulation code pasted ,,no follow up..Awesome explanation❤

[@shashwat_tiwari_st]

Thankyou ❤️🙌✨️

[@VaibhavSingh_code]

you are getting famous day by day

[@shashwat_tiwari_st]

Dhanyawad ♥️

[@PiyushSharma-we8yd]

first😍😍

[@shashwat_tiwari_st]

❤️

[@TrTr-os5vq]

private int rec(int low,int high,int zero,int one,int sum,int arr[])
{
if(sum>high)return 0;
if(arr[sum]>0)
{

return arr[sum];
}
int total=rec(low,high,zero,one,sum+zero,arr)+rec(low,high,zero,one,sum+one,arr);
arr[sum]=(sum>=low && sum

[@shashwat_tiwari_st]

Recursion me TLE aaega, dp lagao