Bhai tum har baar neet code ke video ke baad same problem pe video daalte ho. Kya scene?

love from russia❤

I Had a slightly different approach to this question . Instead of storing characters in stack , i maintained the index of last opening bracket whenever i encountered a closing one . and used a reverse function and made the recursive calls Below is my Code with Linear TC class Solution { string recur(string s,int idx,string res){ if(idx>=s.length()){ string final_ans = ""; for(char i : res){ if(i=='(' || i == ')') continue; final_ans += i; } return final_ans; } if(s[idx]=='(') { s1.push(idx+1); } if(s[idx]==')') { res = Rev(res,s1.top(),idx-1); s1.pop(); } return recur(s,idx+1,res+s[idx]); } string Rev(string s1,int s,int e){ while(s<=e){ char a = s1[s]; s1[s] = s1[e]; s1[e] = a; s++; e--; } return s1; } public: stack<int> s1; string reverseParentheses(string s) { string res = ""; return recur(s,0,res); } }; Also Ty Very Much i was having hard time learning recursion but this intiution came from your stack and recursion series.

Sir, please explain in English

Like target of today's videos is 90. Please do like if you understood the solution 😊

my approach was quite similar with your first approach ,only difference is that i didnt take any list i just considered a dummy string and manipulated it multiple times,but at last shocked by seeing n^2 complexity thatys why i was waiting for your video.

3:30 - Stack Approach 10:11 - Code for stack 13:27 - Approach 2 ( jo mai sapne me thanos ban kr sare infinity stones lekr bhi khud se nahi soch pata ) 23:45 - Code for Approach 2

First view sir

thank you very much 🥰

Good explain sir ❤

❤❤❤

❤❤❤

After solving questions by myself coming here daily to learn a better approach, but I did exactly the same approach today . Gaining confidence to solve questions Thanks.

Sir jo naye videos aye hai aur jo leetcode questions relate hote hai use topic wise playlist me arrange karke dijiye ga ye hi playlist mai please

Why we can't use == operation to check what difference they both have

Hey sir can you tell the approach from which video do I need to start with and how can we utilise your channel in beginners manner + from which video can we expect to solve leetcode problems

Sir the way u explain and dry run each and every concept is very clear to me .I know it's Adv DS but seems to be easy. respect for the effort u r putting. thanks for making this Graph series.. Love u and respect.🫡❤

Sir ye same questions kaa Trie Data Structure use krke optimize solution milega kya..??

Yeh toh DNF ho gaya

Sir ap itna acha parate ho islia apke channel future aur grow karega 🎉

Sir leetcode problem no 2952 ka solution viedo upload kar dijiye bohot confusion hai half test cases hi pass ho rahe hai please sir ❤ bohot try Kara solve karne ka

Thanks 😊

got it

got it❤❤❤❤❤❤

I have solved this question on my own , easy one

amazing and simple as always

Got it ........

I come back to your videos if I want to understand something in the most simplified way. Thanks for knowledge.

love you dada🥰

question toh bahana hai....hume toh attendance lagana haii😌 int main(){ cout<<"attendance++"; }

I will tag on linkedin

Love from England❤

today I solved by my own. But tree visualisation is best. Thankyou 🤩

Like target of this video is 90. If you understood the problem please do like.

Thanks 😊

samjhate theek ho ,but thoda dheere samjhaya kro ; bhaot speed me expalin karte ho ...time leke explain kiya kro

basic question of cpu scheduling of Operating System.

If someone solved merge interval he will definitely able to solve this.

Great

Thank youu, your explanation is super simple and easy to follow. I am glad that i found your channel.

Clear Explanation...thanks bro...!!

class Solution { public double averageWaitingTime(int[][] customers) { int n = customers.length; double totalWaitTime = 0; int currTime = 0; for (int[] customer : customers) { int arrivalTime = customer[0]; int cookTime = customer[1]; if (currTime < arrivalTime) { currTime = arrivalTime; } int waitTime = currTime + cookTime - arrivalTime; totalWaitTime += waitTime; currTime += cookTime; } return totalWaitTime / n; } }

its fails on {6, -3, -10, -4, 0, 2}

भैया जी धन्यवाद 🙏

C++ code bhi do plz

attendance++;

Thanks 😊

2^o(n)+o(1) = 2^o(n)

Love from Urgentina❤

Love from Australia❤