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

[allasandeep]

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

[kartikeyasingh]

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

[nguyenbach]

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

[MR._NEEN]

Your solution is very impressive . A like for you.

[neetankumar]

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

[pratikshabakrola]

class Solution {
public int s) {

int left=0;
int right=0;
int max=0;

for(int i=0;i<s.length();i++)
{
if (s.charAt(i)=='(')
left++;
else
right++;
if(left==right)
{
max=Math.max(max, left*2);
}else if(right>left)
{
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;


}
}

[snehalmishra]

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

[holly_singh]

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

[Area-fdht]

Pratiksha explanation is too good also u are too cute 🥰

[mohammedilyas]

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

[satyamchoudhary]

s =
")(", wrong for this input

[zeynepergul]

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

[ShivangiSingh-wcgk]

Kind of feels like this solution is wrong

[gamerversez]

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

[UnspokenTears]

class Solution {
public int s) {
int c=0;
for(int i=0;i<s.length()-1;i++){
if(s.charAt(i)=='(' && s.charAt(i+1)==')'){
c=c+2;
}
}
return c;
}

} why this code passess only 28 cases can anyone explain what i'm missing??

[princebhati]

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