Remove invalid parentheses | Hard Backtracking | Stacks | Optimization| Love Babbar DSA sheet |FAANG

[@harshvachhani4922]

Great video!!!

[@SumitKumar-fn3gj]

good explanation. thank you

[@adityarajiv6346]

You are welcome!

[@pulkitgpt1234]

memoization was nice !

[@dhruvupadhyay4696]

bhaiya please make more videos....you just abandoned this channel Please be consistent

[@adityarajiv6346]

Sure Dhruv was busy with exams , will be getting back👍

[@ritikpuri209]

what is the time complexity of this code?

[@gamingbar3881]

What is the time complexity here ?

[@karanveersingh5535]

Subscribed brother 👍

[@siddharthsingh6013]

thanks bro.love it.

[@pwnweb5734]

This is not backtracking.. What you did is recursion..

[@getconcept]

Bro can you say what mistakes I have done:- #include #include #include #include #include using namespace std; int invalid(string s){ stack st; for(int i=0;is; int edit=invalid(s); vector ans; unordered_map visited; Solve(s,ans,edit,visited); if(ans.size()==0) ans.push_back(""); for(int i=0;i