LONGEST VALID PARENTHESIS | LEETCODE # 32 | PYTHON OPTIMAL SOLUTION

[@samuraijosh1595]

you say this isnt actually hard haha but what i find hard is finding the intuition that tells us thatt we may have missed some valid parenthesis when we parse it only from left tor right. the left, right pointers is not the hard bit understand, the right to left parsing is.

[@austinmann4023]

(()(((() here is an example, idk why he didn't include

[@harshal9783]

instead of saying that a right to left parsing is required, you should have given an example for the same; it helps in understanding the logic better

[@austinmann4023]

(()(((() here is an example, idk why he didn't include

[@shawnpark5939]

solution itself is easy to understand but i'm still not understanding a input case where going reverse order is needed..

[@preityhansaa9150]

Happy to see this channel growing :) way to go. It would also be nice to see a video like how we can tackle DSA for each company in FAANG like do we have to just do top100 for company tagged leetcode or the videos you mention with company tag or they do a variation on them

[@crackfaang]

Thanks for the kind words! That’s definitely a good video idea for the future… each company is different and the way to approach the onsites varies

[@samuraijosh1595]

Thanks for the video.

[@mariocatzin503]

Thank you!

[@crackfaang]

Glad you enjoyed the video! Subscribe so you don’t miss future ones

[@amandwivedi1980]

nice explanation

[@crackfaang]

Thanks! Make sure to subscribe so you don’t miss any uploads!

[@Drew0Ranger]

@5:45 you clearly do not know which use cases both left and right traversal would be useful, if you knew, you would have shown an example :)

[@austinmann4023]

(()(((() here is an example, idk why he didn't include

[@fxgg-ni4eu]

why dont use stack to solve?😶

[@sachinvarma9949]

because we need to find length not to check invalid