Leetcode 22. Generate Parentheses ||Code+ Explanation + Full recursion flow Walkthrough ||June Daily

[@parth_3856]

Seems like it's one of your initial videos! Quite RAW and CRISPY. GOD BLESS YOU...............

[@MuhammadNabeel-r7x]

I have spent the last couple of days studying backtracking and have watched a few videos and searched online, but I still struggle to comprehend the generate parentheses problem. I appreciate your step-by-step explanation. Thank you. 🙌

[@yashjobalia]

I really appreciate your effort of making the entire flow chart. I was very confused with this problem initially, but now it’s crystal clear to me. Thank You for your time and efforts.

[@kailashmaurya6528]

your explanation and those flow diagrams>>>>>>>>>>>>>>>>>>>>>>>>>>

[@MAHESHAITBECS]

the way you explain is great and the flow chart 🙌

[@stefxnzzz]

just came across this channel, the content you putting out is actually really good.

[@jitendrakumar-vv8ho]

The only channel where i found backtracking explained with code exactly 💯

[@ShubhamTamboli-g2g]

Best explanation ever seen.Kudos to your hardwork.

[@vinayakreddy4954]

Your Explanation is really amazing..You are really underrated..Hope your channel becomes popular very soon..

[@nagraj7569]

I appreciate for your effort on flow chart. It's really helpful.

[@nishakumari649]

you are just so perfect....i can understand no other explanation except your. You are just so perfect.

[@probabilitycodingisfunis1]

Thank you so much Nisha ❤️❤️

[@honestad3558]

your smile at the end tells that youwere satisfied with the video by the way great explanation

[@manojgollapelli9856]

Thanks mam, your teaching style is next level.. Every thing is clear 👍😀

[@tanmayn1984]

excellent explanation, totally understood the sum, thankyou you for the lecture!

[@Ankit-s1h]

best video for understanding recursion and backtracking

[@nguyenbach4710]

thank you very much plz don't stop i have watched more than 3 vids of your channel

[@utsavaggrawal2697]

very nice logic and explanation thanks a lot

[@siddharth.chandani]

Now, I have came to know that I have problem in BACKTRAKING ... BTW Great Exp.

[@saichaithrik7134]

Thank you so much for your explanation madam It has been really helpful during my master's.

[@kannathalasowmya1606]

👌👌👌explained very very well thank you so much you explained very well

[@ShubhEngineer]

Thank u for providing easy and detailed explanation with short and understandable code.

[@saachigupta4545]

this is the best explanation i ever got

[@asutoshbehera2259]

Very well explained.

[@bonafontciel]

The time spent on the diagrams made me give you a like. Thanks!

[@satyamgupta6030]

thanks alot alisha I always check for ur videos whenever I get stuck.

[@MCA_himanshumehra]

your explanation was very easy and helpful .

[@k-universe0022]

i m inspired bcz of u 💜 well done

[@AlbinSabu-y2v]

Woahh.Thats flowchart representation and explanation are pretty good to catch in one watch. You really made it easy Thankyou❤

[@khushiramginnare4961]

Hi Alisha, I was trying to understand how recursion internal work, find correct bracket but now it's clear to me. Thanks a lot. Keep it up.!!

[@KarthikDances]

I really appreciate your thought process and way you explain ❤

[@vaibhavgupta973]

Thank you Alishaa !! your explanation was very easy to digest .

[@harshitsharma5647]

From Yesterdays I watched your helpful video! Thankyou for making very easy and understandable videos!

[@anuskakuila4177]

thanks alisha for this explanation ...

[@kingoftypos11]

that's an apt way to explain this , thanks a lot

[@raghumca8285]

awesome explanation easy to understand with flowchart

[@akgamers4290]

nice explanation

[@JackCoderr]

thank you so much didi, best explaination ever

[@ShreyasShirwadkar]

Very good explanation !

[@prasannapm3220]

Amazing thought process ,easy

[@abhishekanand9451]

mind blowing Explanation🙂🙂🙂🙂

[@namangupta1373]

Thank you didi for this very easy explanation ❤

[@Veeru-qm4rg]

Fabulous explanation mam TQ so much 👏👏

[@khaleelahmad9411]

More power to you girl.

[@pathe6158]

Nice explanation ✨✨

[@HarpreetSingh-pi1ki]

Great Explanation Mam

[@ajaybeldar4981]

Thank you so much , great and super easy explanation

[@shristipurusarthi6675]

thankqqq sooo much for the wonderful explanation ma'am

[@banil636]

appriciate your efforts in making flow chat

[@abhishekbhattacharyya2950]

correct code is easily available but proper flowchart of the recursive calls are not available everywhere. Thanks

[@MaximusGamingGG]

extremely well explained . thank you so much !!

[@vivekswami2182]

very nice explanation love it !!

[@SirAkPandey]

Awesome explanation. Thankyou!! 🙏🙏

[@vasanthanv6143]

Very good explaination

[@Sanush07]

Thank you so much

[@mdimranhosen6674]

Great Explanation.💝

[@srinivasjakhar]

Good explanation thank you..

[@gameonhai5697]

You are a genius. Thanks

[@arukshasilvie]

Your videos are really awesome.

[@probabilitycodingisfunis1]

Thanks!!

[@SomneelMaity]

Thank You Very Much. It was really helpful.

[@nehasht2]

Love ur explanations...

[@Tahzeeb-v4e]

I learned alot,Thank you mam

[@pratyushvaibhav]

it would be good if post those slides on any tlgrm channel , btw you explained through tree before proceeding to code , this is the best approach for recursion problems.

[@barathnatarajan8566]

Beautiful explanation

[@hisenburg-h2g]

what an explanation wahhhh

[@nehanjalimanchikanti3974]

Oh my god ur just amazing

[@joseph2073]

Great explanation and nice diagram mam. Thank you very much 🙏🏻 Your channel is so underrated. I'd recommend you to do some podcasts with popular youtubers like striver, ridhhi, arsh goyal, keerti, etc etc. It'll bring more people to your channel. (Just an idea to gain popularity :)) Hope you've a great day ma'am 🙏🏻🤗

[@soicooc3500]

thanks , very details

[@t6652]

Thanks alot 🎉 helped me

[@muhammadmohsin9997]

Great

[@mayanksaxena7864]

Solved by your logic , watched till 4:56 only

[@lokeshnaidu9324]

Thanks Alisha didi

[@vibhavsharma2724]

Very helpful thank you 🙏

[@Codistency]

nice video...was looking for a similar tree.

[@naturesrevolution]

WHAT IS SPACE AND TIME COMPLEXITY OF THIS SOLUTION?...

[@supriyadas7972]

If someone explain me the base case of this code if(curr_str()==n*2 this piece of line

[@chitranshsaxena59]

Can someone help in explaining the time complexity here? And some detailed way of calculating that?

[@aswitha6065]

very well explained tq but i didnt understand why we dindt pop back when we return plz reply i am so confused about this

[@gyaniyoda4608]

Thank you mam

[@RANJANKUMAR-bc1mw]

code so simple but i diidn't get it .i mean i can't find out the backtracking step in this code

[@siddharth.chandani]

Same goes for me 😅.. BTW do you know how to improve this thing... really appreciate your suggestion..

[@Sanush07]

Thank youvso much

[@joyjain3111]

time and space complexity>?

[@NitinPeace]

Both time and space complexity are O(n)

[@aykay20]

Thank You!

[@dinobandhuchakraborty5202]

thank you

[@subhajitghosh8349]

nice video

[@piyushsingh-ue9xd]

can you share this flow chart

[@md_abdulrahman]

Thanks!

[@CarlosColina-g2l]

Graciasss helped a lottt

[@omkarwalve6292]

thanks

[@surajkumarsingh5305]

Thanks !!

[@AltafHussain-eq6ot]

Awesome explanation keep it up I want to connect with u for coding practice.

[@AltafHussain-eq6ot]

I have my Amazon sde 1 interview on Monday iam very much nervous need your help

[@cinemuzirecords]

greatt

[@silviusyt]

code?

[@sushantagawane8683]

Didi just amazing explanation ever given. Continue giving such nice explanations. Wonderful !!! Didi, did u also post answers to the leetcode contest questoins ???

[@pragatiagrawal201]

I loved the video and understood it completely but the approach that striked my brain was the thumbnail of this video... Anybody here who knows how we can write the code of that approach present in thumbnail....??

[@_ayush_oswal]

excellent explanation, but isn't using pop_back function necessary ??

[@dhruvmittal8018]

same question here if you got the answer would you plz explain it to me

[@praneethadevimudunuri3153]

CAN ANYONE TELL ME WHY THIS WAS NOT WORKING................ class Solution { public void paranthesis(String str,int n,int open,int close,List al){ if(open == n && close == n){ al.add(str); return; } if(open < n){ str = str + "("; paranthesis(str,n,open+1,close,al); } if(close < open){ str = str + ")"; paranthesis(str,n,open,close+1,al); } } public List generateParenthesis(int n) { List al = new ArrayList(); paranthesis("",n,0,0,al); return al; } } OUTPUT THAT I GOT: ["((()))","((()())","((()()()","(()(())","(()(()()"]

[@monikaraut5266]

Awesome explanation 🙌 I also came up with the same recursion tree as in the thumbnail, Wanted to know if it is possible to solve the problem with that approach ?

[@jitendrakumar-vv8ho]

That's the only correct tree a/c to code

[@tarushidubey2973]

💗💫

[@aditigupta6870]

You are very clear and cute

[@kailashmaurya6528]

fannnnnnnnnnnnnnnnnnnnnnnnnnn