MIK Bhai 18:18 agar counter use karenge to "( ) ) (" me true dikhana chahiye jab ki woh false hai. in this case ham condition rkh sakte ki kisi bhi point p sum -ve nahi hona chahiye
The nth Catalan number is a sequence of natural numbers that have many applications in combinatorial mathematics. Catalan numbers count the number of distinct ways[different or separate ways] to correctly arrange n pairs of parentheses, among other combinatorial structures. Binomial Coefficient Formula: C(n)=[1/(n+1)]*[2n/n] for example if Catalan no is 3 then asper above formula answer will be 5 which means there are 5 valid ways to arrange 3 pairs of parentheses below output ((())) (()()) (())() ()(()) ()()()
Hi Mazhar I really liked your channel but I want to tell you many times when I see a new question I dont know what to start seeing your video give confidence but what I am doing wrong or should do better ?
in your loop, put condition, ki agar value kabhi bhi -1 ho to return false. so, in your case, peheli iteration par hi value -1 hogi, hence return false
bro ek doubt hai jaise aapne bola ki jab bhi options and chocies dikhe question mein toh recursion socho but maine ek chiz notice kari ki is question mein hum 2 options try kar rahe hai open bracket ya close bracket but subst vale question hum try kar rahe hai ki ya to nums[i] ko include karenge in subs ya exclude toh ye chiz question pe depend karegi ki options kya and hume konsa approach lagana hai ? please eaboarte on it bro ye backtracking bohot tough lag raha hai khud se nahi such pata hun
for n=3 .size() function returns 6 and when a desired string is achieved of size 6 (2*n) we'll store the string , having it n-1 will reduce the size to 5 which isn't valid
Correction : Video-14
Very underrated channel
hard one becomes easy :) when it's @CodestorywithMIK!!! definitely one day you will be the king in DSA world.
subeh subeh ek भाषण miljata hai to maja aajata hai bhaiya 💞💞
MIK Bhai 18:18 agar counter use karenge to "( ) ) (" me true dikhana chahiye jab ki woh false hai. in this case ham condition rkh sakte ki kisi bhi point p sum -ve nahi hona chahiye
Amazing, how many videos remaining in recursion? Please completeee sirrrrrr…
As always you made the concept very clear and easy... Thanku Bhaiya for providing such a wonderful explanation
Hey mik can you make a video of today's leetcode contest 3 and 4 th question. Thanks in advance.
Yes plz make a video of weekly contest 3 and 4
Please also resume your HLD playlist as well, those were really helpful
Wow you have explained in very easy way♥️
Amazing explanation
The nth Catalan number is a sequence of natural numbers that have many applications in combinatorial mathematics. Catalan numbers count the number of distinct ways[different or separate ways] to correctly arrange n pairs of parentheses, among other combinatorial structures.
Binomial Coefficient Formula: C(n)=[1/(n+1)]*[2n/n]
for example if Catalan no is 3 then asper above formula answer will be 5 which means there are 5 valid ways to arrange 3 pairs of parentheses
below output
((()))
(()())
(())()
()(())
()()()
dil jeet lete ho ekdm
14/18 done [31.7.24] ✅✅
Incredible Brother🫶🏻
Woow, such a good explanation.Keep up the great work . Your videos are so helpful.
U r the best bhaiya :)
Hi Mazhar I really liked your channel but I want to tell you many times when I see a new question I dont know what to start seeing your video give confidence but what I am doing wrong or should do better ?
If you are getting started,
Try watching this guide video - th-cam.com/video/2Jshfog1ETg/w-d-xo.htmlsi=fBWkSUusVAWM1EeX
Hope this helps ♥️
Thankyou so much mik. :)
*but count wale approach me toh ))(( ye bhi valid ho jayega na -1-1+1+1 = 0*
in your loop, put condition, ki agar value kabhi bhi -1 ho to return false.
so, in your case, peheli iteration par hi value -1 hogi, hence return false
@@aviralgoel5709thanks
Bhuje babua
Please sir make video for question : leetcode 959. Regions Cut By Slashes , it is really confusing
bro ek doubt hai jaise aapne bola ki jab bhi options and chocies dikhe question mein toh recursion socho but maine ek chiz notice kari ki is question mein hum 2 options try kar rahe hai open bracket ya close bracket but subst vale question hum try kar rahe hai ki ya to nums[i] ko include karenge in subs ya exclude toh ye chiz question pe depend karegi ki options kya and hume konsa approach lagana hai ? please eaboarte on it bro ye backtracking bohot tough lag raha hai khud se nahi such pata hun
Very much helpful, thankyou
creating good content
Bhai concept ki videos kab upload kroghe
more easy code
res = []
def bt(op,close,cur) :
if len(cur) == 2 * n :
res.append(cur)
if op < n :
bt(op + 1,close,cur + '(')
if close < op :
bt(op,close + 1,cur + ')')
bt(1,0,'(')
return res
Thank you so much
Today leetcode contest questions explain
DSA king
Why we are calling recursion for n length again it should be for n-1 length.
for n=3 .size() function returns 6 and when a desired string is achieved of size 6 (2*n) we'll store the string , having it n-1 will reduce the size to 5 which isn't valid
bhaiya time complexity smj nahi aai 1st ki
merko dusre ki nhi aayi
Bhai concept ki videos kab upload kroghe