Leetcode 32 Longest Valid Parentheses

[@allasandeep1466]

One of the best Solution , Mam do the leetcode problems like this way its very help to us

[@sriracha9729]

ok sir

[@nguyenbach4710]

plz don't stop the way u explained so clearly and specify thankyou very much

[@pratikshabakrola]

Hello Nguyen, Thank you for your feedback! Appreciate it! Will upload more videos soon!

[@kartikeyasingh5172]

Excellent solution , this one is more intutive , as compared to stack one.

[@priyanshu5407]

nice one

[@pratikshabakrola]

Thanks

[@snehal5429]

My approach was same but I was not doing checking in reverse direction, thanks

[@pratikshabakrola]

Great 👍

[@ritikshandilya7075]

We really need more such great solutions , thanks for amazing explanation and approach.

[@neetankumar4449]

wasn't able to understand why two traversals : start to end and end to start, just understood, thanks bakrola mam

[@pratikshabakrola]

Glad it helped!

[@phardik5610]

most clever solution out there for this question

[@holly_singh]

great video, can you please make videos of graph questions ? Esp the ones that are not solved on other channels

[@sivan2878]

Great video, thanks a lot Pratiksha

[@MR._NEEN]

Your solution is very impressive . A like for you.

[@pratikshabakrola]

class Solution { public int longestValidParentheses(String s) { int left=0; int right=0; int max=0; for(int i=0;ileft) { left=0; right=0; } } left=0; right=0; for(int i=s.length()-1;i>=0;i--) { if (s.charAt(i)=='(') left++; else right++; if(left==right) { max=Math.max(max,left*2); }else if(left>right) { left=0; right=0; } } return max; } }

[@MrVlog-04]

nice approch to solve this question

[@vninfo.2739]

wow this is very easy solution

[@abhaychaurasiya5548]

never found such clear explanation

[@pratikshabakrola]

Thanks for sharing! I am glad you found it helpful!

[@triggeredinsaan_mini]

One of the beat and easy solution

[@JayPrajapati-lj8pw]

great maja aagaya

[@shivamshukla438]

Thank you good explanation

[@PraveenKumar-kl2xi]

nice solution, great logic

[@AnkitPandey-s9h]

very informative vedio

[@Area-fd8ht]

Pratiksha explanation is too good also u are too cute 🥰

[@pratikshabakrola]

Thank you!

[@prashantbhati8705]

mast explain kiya hain :)

[@barathkumar3583]

Good

[@mohammedilyas8824]

Ma'am pls make videos on most important questions for sde role fresher

[@pratikshabakrola]

Hello Mohammed, I will try to put something together on that topic. Thank you for suggesting that.

[@singhji4149]

Great explanation

[@pratikshabakrola]

Glad it was helpful!

[@vvek_7]

Very Clear

[@pratikshabakrola]

Glad to hear that

[@sarojkumar-nu8vo]

well explained great 👍

[@pratikshabakrola]

Thank you Saroj Ji 🙏 Make sure you share it with others who may find it helpful 😊

[@mayurs9319]

nice🎉

[@pratikshabakrola]

Glad you liked it ! Make sure to share it with your friends 🙏

[@mayurs9319]

@@pratikshabakrola I did ;)

[@zeynepergul4768]

what if that would be a stack and they ask for thw range between indexes at longest parantheses

[@ShivangiSingh-wc3gk]

Kind of feels like this solution is wrong

[@vineeshashwin2697]

🎉💥👑

[@deepakkumar13204]

Well explained mam ❤

[@pratikshabakrola]

Thanks a lot 😊

[@xyzhacker00999]

you and your solution is so beautiful

[@feelyourbeat7820]

I came here just to see her beauty ❤

[@UnspokenTears]

class Solution { public int longestValidParentheses(String s) { int c=0; for(int i=0;i

[@adi9003]

you are only considering strings which which have ')' just after '(' -> for example, ()()() but this code will fail to answer correctly when I give ((((())))), it is correct string but according to your logic it is not correct.

[@gamerversez5372]

I think you should give proper explanation why another traversal is needed

[@pratikshabakrola]

Good feedback! Thanks

[@satyamchoudhary2573]

s = ")(", wrong for this input

[@CodeWithSeenu]

else if(l < r) { r = 0; l = 0; } not an issue

[@Karthik-ev7jy]

Not working for some test cases

[@vinaysen6710]

Beauty with Talent

[@24_Focus]

turunin

[@satyamchoudhary2573]

name se laga Indian hai but awaj se angrez , Kya bawasir hai 🤣, BTW nice explaination

[@AmitKumar-fk8mm]

aapke aashirwaad se mera package 15 crore ka lag jaayega 😌

[@pratikshabakrola]

My well wishes to you!

[@KaifKhan-sb2yr]

Glt solution hai bhai 🫠

[@princebhati6376]

How do you get the job in usa, can u make a video about that.

[@pratikshabakrola]

Thank you for the suggestion. I will see if I can put something together on that subject, if I am not able to make a video, I will share some tips via email/call. You can follow my Facebook page and stay connected!

[@princebhati6376]

@@pratikshabakrola , i think linkedin would be better.

[@pratikshabakrola]

+Prince bhati Yes, I agree. That’s a great idea!

[@thomasshelby6780]

wannabees be faking day and night

[@EdgarRamirez-ry2je]

You are beautiful

[@RamyEldesoky]

This solution doesn't solve "()()"

[@EdgarRamirez-ry2je]

Hello do you have a boyfiend ???

[@ManishRaj-zm5gs]

galat hai

[@pratikshabakrola]

Feel free to share the code that you think is right for our viewers

[@Karthik-ev7jy]

public class Solution { // DO NOT MODIFY THE ARGUMENTS WITH "final" PREFIX. IT IS READ ONLY public int solve(final String A) { Stack stack = new Stack(); int maxLen = 0; stack.push(-1); // Push -1 to represent the starting index for (int i = 0; i < A.length(); i++) { if (A.charAt(i) == '(') { stack.push(i); // Push the index of opening parenthesis } else { stack.pop(); // Pop the matching opening parenthesis index if (!stack.isEmpty()) { maxLen = Math.max(maxLen, i - stack.peek()); // Calculate length of valid substring } else { stack.push(i); // If no matching opening parenthesis found, push current index } } } return maxLen; } } @@pratikshabakrola