LeetCode 22. Generate Parentheses

[@ashishranjan4623]

At the stage of life your viewers usually might be, the fact that you are putting out all this content is more than enough, even if the explanation is not very precise. So don't feel bad, just keep uploading. You are really helping a lot.

[@MrThepratik]

"close < open" really saves a good deal of code . I was thinking to generate all possible combination and terminate if length exceeds or if its an unbalanced string

[@surajdhar4484]

can you explain how "close< open" saves more time than "open>close"?

[@JSDev776]

they will work exactly the same if that's all you're changing,

[@sabisyed]

i was beating my head around this for hours and i think i went over your video atleast 8 times and i finally got it !! thanks a ton !

[@projectsdb4034]

Would love to see your walkthrough code complete on white board.

[@sreekantht.m1964]

You have awesome teaching skills. Understood it in one go after watching ur vid.

[@stuxvt]

Your discussion of making a template to backtracking, and working through the logic while adjusting input variables helped me solve "Letter Combinations of a Phone Number" using the same method without looking anything up. Thank you, feel much more confident on building elegant backtracking solutions.

[@rakshith3547]

Please plan to do whiteboarding and explaining the backtracking tree and what happens in the stack trace. That helps a lot compared to just typing the already existing solution!

[@naveenkumarbr1111]

Can you also please explain the big O for time and space with such problems, that would be very helpful. Great explaination !

[@JM_utube]

good video, nick. honestly it takes a while to get backtracking, then to REALLY get backtracking

[@deepeshkataria453]

I was wondering how the solution is being checked , caz solution patterns are printed in any order!

[@kaushal136]

So I have been doing leetcode and backtracking since 2 months and your 1 12 min video made me learn so much more ! Thnxx

[@BhavyaBhaga]

I am writing this comment and i really hope you read it. I love the way you solve problems, you keep the explanations so crisp & clean without extra talks. I learnt so much from you. I wish you the best Nick.

[@deanhu3410]

brilliant explanation. showing n = 2 as an example really helps.

[@sunilraut4719]

I am following many youtubers over the year but when you explain a solution to a complex problem it just sounds easy, I really like your approach. Keep the good working going !!

[@Firecloak]

The leetcode solution didn't make much sense to me, but your video clears it up!

[@RK-nw1nq]

Hi man, great video and an amazing explanation. Do you think you can make a video in the future explaining this code's time complexity? It would be very helpful. Thanks!!

[@eugenevedensky6071]

I think the interesting part about your algo is that the if statements prevent us from creating redundant duplicate strings, which is really clever. I sovled this but ended up using a set to avoid the duplicates, which obviously screamed hack to me.

[@suhailahmad6505]

Just Amazing, don't have words about the way you have written the details of the recursive call, Thanks a lot man, appreciate your work

[@xuehaizhou8335]

don't understand why backtrack doesn't generate duplicate strings. anyone can help me with it?

[@sureshgarine]

I really like the way you generalize how the template would be for backtracking, very nice explanation. Thank you nck. keep doing the good work to help us

[@bellahasguns]

love your video and expanation. could you do a walk thru on 131. Palindrome Partitioning, it is a backTracking as well, but having a hard time understand the step inside the recursion calls? appreciated.

[@Rayyankhantheboss]

as far as I know backtracking is going back, changing the solution and then recursing again, however u never backtracked u only recursed smartly making sure u chose valid paths

[@suhailahmed278]

Could anyone tell me what is the time complexity of this solution? Please!

[@Dani-zf7cu]

Thanks so much Nick. Really helped me understand backtracking and it was pretty great and clean code.

[@dipeshpandey4624]

Thanks for discussion and explanation, I believe this solution is also going to push 6th item as ()())(, so we might have to check the validity of parenthesis before pushing into the list in line 10. I checked with n = 3.

[@MrVenona]

Went to a number of other pages/videos for this. You are the best! I don't need to search more!

[@heisenberg1844]

Hi Nick. I really liked the explanation. Please do more backtracking problems. Thanks.

[@anirudhbukka5413]

Is this really backtracking? It seems to be just recursion, we are not "backtracking" to any point anywhere in the code.

[@pranavsriram8]

Thanks man, really helped understand backtracking! Great video! You don't need to redo!

[@pranav53465]

Great comment and great name

[@rathan235]

Hi Nick, thanks for the explanation. Can you please explain how to solve it with stack?

[@sober_junkie5709]

I never understood how the generation of the next combination started on it's own...

[@LoLLuL-d5m]

is it really backtracking, I don't see where we are backtracking a decision we already made. we are not removing chars from the string that we already added.

[@LoLLuL-d5m]

seems recursion to me. Explain pls

[@yumo]

Implementation of this was really clean

[@andresabello5639]

You are awesome at what you do. Keep in coming, my mentor!

[@alphagrowth3327]

Thanks for the solution and the dry run.

[@yanchengpan543]

can you draw out a tree for this? plainly through recursion is still kinda hard to imagine

[@kaustavprime3920]

What's the space and time complexity of the solution?

[@vanessachammas352]

super helpful, but if you could leave a link of ur notes so we could follow through that would be cool~

[@ashutoshpandey1473]

Can somebody explain that why this solution is not working with StringBuilder instead of String?

[@nirmal4343]

Nice work!, what would be the time complexity?

[@zacharysong4863]

It works if delete the line 11 return;

[@shubhamkhurana7545]

An Absolutely "WOW" Solution !!!

[@NickWhite]

i feel like i fell off the leetcode train so bear with me while i get back up to speed

[@shalin09]

It will be good if you explain the time and space complexity after solving the problem. That would really help! Thanks in Advance :)

[@pranavyeleti3499]

nick do u individually study or u study with another partner

[@priyankagaikwad9909]

what is the time complexity of this algorithm? Looks more than 2^n

[@ujjvalsharma5055]

Hey Nick I have been watching your videos for a quite some time now, and I wanted to say that you are doing a great job here. Keep it up :).

[@aspa-n-fyt7785]

Hi! i i got 4 lines instead of 5 with n=3: ((())), (()()), ()(()), ()()() without (())(). what is the problem?

[@OmarAhmed-od9rf]

How does this esnures there are no duplicates?

[@OmarAhmed-od9rf]

insures*

[@sauravthakur2915]

Isn't this solution a recursive solution rather than backtracking ?

[@InfoBuzz1130]

My favourite youtuber. love your vids man

[@wardenofthenorth-w5d]

Wow... I knew you years ago but never spent time watching y. It's amazing...

[@sasivardhanbonthu8159]

Already open=2 at starting but int close less than open you wrote 0 less than 1 but open =2 know?

[@helperclass]

Explanation was really helpful. Thanks!!

[@nking99t]

So this is a Greedy Strategy right? it is hard to demonstrate close < open will output the valid ones. so you just need to remember the answer. if this is your first time seeing this question, it may be hard to comes up with this strategy.

[@amansayer4943]

imagine if he uses a board to teach this stuff it will be cleared in one go

[@aman6561]

it's one of the best explaination mate.

[@bhavukpahuja269]

Great Explanation. Completely understood.

[@dev-skills]

backtracking very well explained.

[@nagalakshmichithambaranath1147]

Wow, this backtracking never gets into my brain. you explained it so nicely.

[@vasubhatnagar3352]

please can you help me understanding backtracking..i'm trying from past 2 months but failing miserably.

[@nagalakshmichithambaranath1147]

@@vasubhatnagar3352 any recursive backtracking can be assured achieved by iterative breadth first search. If you are comfortable with iteration, you can try that.. word search by Nick white covers one such..

[@nagalakshmichithambaranath1147]

@@vasubhatnagar3352 backtobackswe also covered backtracking recursion.. solving Sudoku or solving maze can be achieved by recursive backtracking. Don't lose hope.. just keep trying

[@himanshurajpal7842]

Is this backtracking? You only used recursion

[@pacificknight414]

Very clear explanation, thank you very much!

[@killingjoyandmemeing]

Found Goldddddd!! Thanks man

[@chiragaparadh1417]

I thought we would use those Catalan numbers here...

[@raaghaviravisankar1853]

Thanks for such precise neat explanation

[@gopikrishnan8182]

Good explanation. Thanks Nick

[@rahulmistry9173]

Oh man! That was flawless....WOW man....

[@handanunal4040]

The video helped me a lot understanding the problem, thanks

[@soffwhere]

Trying to solve this alongside you, set playback speed to 0.5X. You sound like a brilliantly hilarious drunk. Also-- thank you so much for your content!

[@nathamuni9435]

thanks but plzz try to explain as neetcode does... pretty easy

[@rak590]

Great video Nick. Thanks a lot!

[@yutingsun1690]

if I change open + 1 to open++ it would not work, can anyone explain why?

[@zacharysong4863]

Open++ will add "1"after that traverse, the thing you need is ++open.

[@kunalkheeva]

perfect, thank you.

[@xufengzheng1318]

support from China!🥳Very good explanation

[@yuzhudong8044]

Crystal clear!

[@ahmede7141]

Thanks a lot!

[@AmolGautam]

Thank you so much.

[@liedebunker1253]

That's a much higher hand. I'm ashamed of myself.😓😓

[@user32132x]

Thanks 🙂 it was very helpful keep it up. 👍

[@pepetikesavasiddhardha7852]

nice and simple logic

[@missionstatusactive8470]

ur good bro.....need guys like u who teaches ds LOLzzzz

[@maarcusfonseca]

good explanation

[@davaa847]

Hey man, it was good. Thanks.

[@hawsh3066]

3 videos in 5 hrs XD

[@AkshayKumar-xh2ob]

Great video

[@Naton]

Please slow down on the scroll. Hard to follow. Might as well use pythontutor

[@zachsun3893]

you fuckin legend bro

[@pradeepmehra6879]

Lovely !!

[@triplestrikee875]

like it!

[@abe10]

Great video this. Sadly he's pushing crap videos now a days 😔