Check if a Parentheses String Can Be Valid | Leetcode 2116

[@rajnandini9862]

very well explained. I was stuck in so many if else conditions based on wildcard , opening, closing. But your explanation made it easy to understand. Thank you sir!!

[@techdose4u]

nice :)

[@VishyAnand-s5e]

Excellent explanation sir. Really understood it well!! Thanks a lot!

[@techdose4u]

Nice :)

[@vedantzawar5218]

Very easy solution ! Well explained sir !

[@techdose4u]

Thanks :)☺️

[@SumeetYadav-u7s]

excellent solution

[@techdose4u]

Thanks :)

[@programming6177]

thank you so much bro awasome teaching🤗🤗

[@techdose4u]

welcome :)

[@Abhishek-e6d2c]

loved it!!

[@techdose4u]

great :)

[@mani2632]

well explained sir, thank you

[@techdose4u]

You are welcome

[@drain1635]

Thank you

[@duongducanh206]

What is the software that you use to draw here? Appreciate it uf you can share

[@АлександрЮшкевич-ц7ь]

Thank you very much for the solution. It's easy but the problem has so low acceptance rate.

[@techdose4u]

coz of wild cards :)

[@mdnoverflow]

best

[@techdose4u]

thanks :)

[@Anbu-x2k]

i don't know why single pass is not enough can anyone explain plz...

[@techdose4u]

coz in single pass you can only know about wild cards on left NOT about right. Finding imbalance is not enough for this problem. Wild cards can be used to balance it :)

[@Anbu-x2k]

@@techdose4u thank you for your response

[@godFather-123-b8g]

did you take offline classes somewhere?

[@techdose4u]

Yes from class 6th I am teaching JEE prep in College Coding Since masters :)

[@AbhinavGavade]

this question was marked as Medium by leetcode but it was Hard !

[@techdose4u]

Yea it has prerequisite questions. As mentioned at beginning, if you solved them then its medium else Hard for someone new to

[@HeroicVampire]

i dont understand first your voice is not clear then you are not telling clearly about what steps you are doing.. you just like blindly reading

[@techdose4u]

Do you mean the question ? Your feedback is appreciated.

[@AMANKUMAR-rz3fu]

Great soln. Pls be a little slower sir. Tnx

[@techdose4u]

I was actually expecting the Valid Parenthesis to be known before solving this, otherwise this question will be hard to solve :)

[@BholaSingh-m8z]

I couldn't understand much; everything went over my head. Your teaching pace is very fast. It would be great if you could simplify the explanation and make it more beginner-friendly.

[@neerajgarg9096]

simple consider we go with 2 pass solution: class Solution { public boolean canBeValid(String s, String locked) { int n = s.length(); //odd length return false if(n%2!=0){ return false; } int openingbBracket=0,closingBracket=0,wildCount=0; for(int i=0; i

[@techdose4u]

You can watch Valid Parenthesis problem :) This is a harder problem from the rest which I had mentioned.