Remove Invalid Parentheses | Leetcode 301 | C++

[@smritigupta9730]

In love with your explanation! Every question you explain becomes crystal clear. THANKYOU😃😃

[@AyushiSharmaDSA]

Thank you so much Smriti 🤗

[@webtechbysuraj5942]

We're getting TLE using this approach!!

[@aravindkumaresan2747]

Hi @Ayushi Sharma, thanks for the great explanation. But I do have some questions/suggestions to optimize. 1. This algorithm will try to remove the chars as well 2. We can just check the count of left or right invalid parantheses. Eg. If the invalid parentheses are just ))) from the stack output, then there's no point in removing ( parentheses in recursion Let me know if these approaches work better!

[@shrimpo6416]

Great video! I love it especially when you explain each part of your code with graphs, so useful! please please keep doing more!

[@AyushiSharmaDSA]

Thank you so much, glad it was helpful :)

[@surparaju2945]

Good video with an explanation along with diagrams. Please keep doing more and more. Thank you :)

[@AyushiSharmaDSA]

thank you :)

[@vinitverma1741]

that's the superb explanation ma'am ! 😄

[@AyushiSharmaDSA]

Thanks a lot 😊

[@tombrady7390]

yes we needed quality questions like this awesome didi.

[@AyushiSharmaDSA]

Thank you Prajjwal. Sure✌🏻

[@swapnilhajare5557]

Thanks for the Video, great explanation.

[@AyushiSharmaDSA]

You are welcome! :)

[@hassankazmi5443]

Great job on explanation, diagram was really helpful!!

[@AyushiSharmaDSA]

thank you :)

[@46anuragmodi14]

this video was really a good one. expecting some more videos on recursion and backtracking. thanks for making such a great video.

[@AyushiSharmaDSA]

Thank you Anurag. Sure, more videos on the way🙂

[@aradhyanigam6109]

Literally ,What an Explaination ... 🔥 Thanks Mam 🙇🏻‍♂️

[@AyushiSharmaDSA]

Welcome. Glad you found it useful :)

[@aradhyanigam6109]

@@AyushiSharmaDSA 🙇🏻‍♂️🙇🏻‍♂️🙇🏻‍♂️

[@shubhamkamdi6606]

Very beautifully explained

[@AyushiSharmaDSA]

thank you Shubham :)

[@adityabhandari6688]

you made a leetcode hard question so easy.. salute

[@AyushiSharmaDSA]

Thank you Aditya, glad it was helpful :)

[@mayankkumar4864]

Mam, the problem is not being accepted in leetcode as the code is giving wrong answer for me, it is giving the same wrong output to t me as being displayed at timestamp at 10 : 20 , kindly look into this

[@llamamerogelio]

Really well explainen!

[@AyushiSharmaDSA]

thank you, glad it was helpful :)

[@arshadiqbal2893]

nice

[@rohandevaki4349]

at 3:00 , all the possible cases are sometimes returned by DP also right? or no? backtracking also

[@jatinbhuker7929]

Code is not working for all test cases like this - d(((p)((x( this test case is on gfg, any help btw nice explanation.

[@rohandevaki4349]

i have tried to solve this in recursion method by first branch would be to take that character, second is to not to take that character, but this is giving me run time error, what else could be the possible way to solve this?

[@tridibbag6186]

resume share nehi koroge apki?😢😢😢 video bana do ek apki resume ke upor........by the way nice explanation👌❤

[@AyushiSharmaDSA]

Karungi, bas thodi der wait krlo🥺

[@trivedi2690]

hi aryusi had you use codesignal plateform ?

[@AyushiSharmaDSA]

No, I haven't

[@sagarbora7768]

Mam in this problem where bktracking is used?

[@hemantsurariya3239]

Thank you :)

[@AyushiSharmaDSA]

Welcome, glad it was helpful :)

[@ecs185_shaileshbharti3]

Perfect Explanation 💯🔥

[@AyushiSharmaDSA]

Thank you Shailesh :)

[@ramkrushnapatra1217]

What is time complexity of the code?

[@nitishrathi3191]

solution is wrong ..

[@swingstockstrader]

You are in which year mam

[@AyushiSharmaDSA]

I am currently working

[@45_ritiksharma32]

In java this will give tle

[@sanskargubreley8754]

what's the TC?

[@amulop]

Hello didi apka koi social media account nhi ha ?

[@AyushiSharmaDSA]

you can connect with me on linkedIn

[@amulop]

@@AyushiSharmaDSA but message section is locked there im already connected ?

[@AyushiSharmaDSA]

@@amulop is that so, can you share your LinkedIn link

[@amulop]

@@AyushiSharmaDSA didi kr diya message thank you ❤️

[@sudeepsudarshanrana800]

no !

[@aakashvishwakarma4653]

🪔🪔Happy diwali Mam 🪔🪔

[@AyushiSharmaDSA]

Happy diwali Aakash🙂

[@rams2478]

Great explanation.. however in Java it is exceeding the Time Limit. Anybody faced the similar issue in Leetcode for Java?

[@shushantgaur9420]

i am doing it in c++ and it is showing the same thing. TLE :(

[@shushantgaur9420]

i guess you are doing the same mistake I was. you should put all the string inside the map irrespective of whether it is valid or not. that way it will run faster.

[@rohandevaki4349]

we are getting TLE for this type of case ""()((((((()l("

[@joebale9670]

yeah same here , how did you solve it??

[@ronaldsitumorang2250]

She already used hashmap mp in her code to avoid TLE issue, it is called memoization.

[@ranjitchakraborty6166]

Wrong explanation