1249. Minimum Remove to Make Valid Parentheses || Leetcode || Code + Explanation

[@Ankitsingh-my1vu]

Better than all present on KZbin

[@probabilitycodingisfunis1]

Thanks!!

[@venkateshn9884]

Great explanation❤

[@anirutthsa6237]

super mam

[@khushiramginnare4961]

Thanks Alisha!!

[@Ishuxxsingh]

What is erase function???

[@MitrankShah]

Thank you for such great explanation!!

[@rohitparthasarathy6671]

Very well explained.

[@sachinbharti3016]

Good explain mam

[@gauravbanerjee2898]

Thanks a lot Ma'am

[@raniabenkhayat6033]

best explanation thank you

[@ashvinkumhar5819]

Thanks dii

[@adityagarg9806]

This approach will not work for )()(

[@amansayer4943]

import java.util.Stack; class Solution { public String minRemoveToMakeValid(String s) { Stack stack = new Stack(); StringBuilder sb = new StringBuilder(s); for (int i = 0; i < sb.length(); i++) { if (sb.charAt(i) == '(') { stack.push(i); } else if (sb.charAt(i) == ')') { if (!stack.isEmpty() && sb.charAt(stack.peek()) == '(') { stack.pop(); } else { stack.push(i); } } } while (!stack.isEmpty()) { int removeIndex = stack.pop(); sb.deleteCharAt(removeIndex); } return sb.toString(); } }

[@yashmundra8497]

Awesome