Leetcode 32 Longest Valid Parentheses

Leetcode 32, Longest Valid Parentheses, 32. Longest Valid Parentheses, Leetcode 32. Longest Valid Parentheses, Leetcode Java Solution, Leetcode Java Solutions, Google Interview Question, amazon interview Question, Leetcode Java,Java solutions #Leetcode , #LeetcodeSolutions, #LeetcodeSolution #LeetcodeJavaSolutions #LeetcodeJavaSolution
Connect with me on Facebook : / pratikshabakrola
Subscribe to my channel: / @pratikshabakrola

[@sivan2878]

Great video, thanks a lot Pratiksha

[@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!

[@holly_singh]

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

[@priyanshu5407]

nice one

[@pratikshabakrola]

Thanks

[@prashantbhati8705]

mast explain kiya hain :)

[@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!

[@user-gq3xu4vj8d]

very informative vedio

[@abhaychaurasiya5548]

never found such clear explanation

[@pratikshabakrola]

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

[@zeynepergul4768]

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

[@sarojkumar-nu8vo]

well explained great 👍

[@pratikshabakrola]

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

[@snehalmishra5429]

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

[@pratikshabakrola]

Great 👍

[@JayPrajapati-lj8pw]

great maja aagaya

[@vineeshashwin2697]

🎉💥👑

[@singhji4149]

Great explanation

[@pratikshabakrola]

Glad it was helpful!

[@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;

}
}

[@Area-fd8ht]

Pratiksha explanation is too good also u are too cute 🥰

[@pratikshabakrola]

Thank you!

[@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.

[@deepakkumar13204]

Well explained mam ❤

[@pratikshabakrola]

Thanks a lot 😊

[@vvek_7]

Very Clear

[@pratikshabakrola]

Glad to hear that

[@mayurs9319]

nice🎉

[@pratikshabakrola]

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

[@mayurs9319]

@@pratikshabakrola I did ;)

[@Karthik-ev7jy]

Not working for some test cases

[@24_Focus]

turunin

[@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

[@vinaysen6710]

Beauty with Talent

[@AmitKumar-fk8mm]

aapke aashirwaad se mera package 15 crore ka lag jaayega
😌

[@pratikshabakrola]

My well wishes to you!

[@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!

[@satyamchoudhary2573]

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

[@satyamchoudhary2573]

s =
")(", wrong for this input

[@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