Видео

great explanation!

Solution : 1. Add all of the opens, then add all of the closes. This produces the first combination. 2. Remove characters from the string until we find an opening parenthesis. Remove the opening parenthesis and check whether close < open. 3. If close < open, add a closing parenthesis to the string. Next, add the remaining opens, then add the remaining closes. Repeat step 2. If close >= open, repeat step 2

great explanation !

Great job, nobody explains like you do on YT

Thanks man for explaining that recursive tree as well as code explanation.

Woww!! M gonna remember this for the rest of my life!

What is the space complexity for this

Great solution and thinking, thanks!

Best explanation!!

Wow, truly the best explanation of this topic

It would be nice if you have java and python verison.

Good explanation. Thank you

An excellent teacher ❤

😇

That was the only video that helped me to really understand what happens in a backtracking solution. Thank you sir

Man you are a life saver !

best explanation on youtube hands down

please start posting new videos, I watched loads of algothrim videos, yours are the ones that make more senses. and easier to understand, Thank you~~~

i love that you did it in the execution order

this is the best illustration for recursion tree when called under a loop, every video just draw a two way or three way branch from beginning but this was exactly step by step , thnx

O(n!)

hello sir i have a problem regarding making combination can you solve it please

great job thank's that was clear!

Keep going man....your explanation skills are just awesome :)😃

Awesome explanation sir. Thanks for this!

Thank you for your patience and hard work for actually walking us through the recursive process. The recursion tree is clear and solid. You really know what you are teaching unlike most of the LeetCode RUclipsr out there who only copy and paste code. Thanks again!

Read the way of solving it using GeeksForGeeks, AlgoExpert, Leetcode prime solution explanation, couple of youtube videos. Didn't understand it from any, but you. Thank you.

the removal of one element from an array itself is an O(n) complexity. That turns your solution into O(n*n*(n!))

the best

Jesus, what an underrated video. Thank you so much, mate!!

No one cared to explain how recursion is working inside the for loop. But you did it thanks a lot man!!

nice

Thank andi guru garu, ee logic ardham kaaka oka roju antha chacchi poya!

Nice explanation!

Wow! You did a phenomenal job of explaining this in much simpler terms. Thank you so much for making this. Now, I understand this problem way better. I have one question though - Isn't the time complexity O(n * n!) from the tree diagram you illustrated? n times we are doing n! right, or can we reduce O(n * n!) to O(n!)?

Great explanation of the problem and solution! Nice one!

Today marks 3 years since you posted this video. Why have you stopped posting new videos? You are a very good teacher, Sir. You have a divine gift. Recursive thanks to you. PLEASE START POSTING NEW VIDEOS.

1:22 algorithm - 1:29 recursion 1:54 go through the recursion tree 2:40 11:46 code

no more updates? best video

Can somebody do this with java. ?

Wonderful recursive explanation !!! Thank you.

int findMaxLen(string s) { // code here stack<int>st; st.push(-1); int ans=0; for(int i=0;i<s.size();i++){ if(s[i]=='(')st.push(i); else{ st.pop(); if(st.empty()) st.push(i); else ans=max(ans,i-st.top()); } } return ans; }

This video is very well done. Good Job. Man!

The way you explain about call stack, this is appreciable.

Very nice explanation. Can someone show how to do write this in Python?

Awesome !

Love you bro

Best explanation I have watched. Thanks!

Very nice explanation. Time complexion will O(nm) where n is number of candidates and m is a target. You have 2 inputs. So first shit * second shit.

How do you do that call stack step by step thing? Are those just slides?