20. Valid Parentheses || NEETCODE 150

[@soumyopandey7974]

Good explanation didi...
Stack problem are very important..😊

[@ankitraj2283]

Done ✅✅

[@avadhut__45]

If there is will there is a way

[@inspireyou_125]

Day-21 ,Task completed✅.
Thank you Didi😊

[@TechWithSaumya]

Great job!

[@AK-iz4xi]

Hindi me padhao aap ka channel jyada grow karega👍🏻👍🏻👍🏻

[@shatnuu_]

Sahi baat Bhai 🎈

[@prathamgoel3386]

Brute force Approach
class Solution{
public boolean isValid(String s) {
Stack stack = new Stack();
for (char ch : s.toCharArray()) {
if (ch == '(' || ch == '{' || ch == '[') {
stack.push(ch);
} else if (ch == ')' && !stack.isEmpty() && stack.peek() == '(') {
stack.pop();
} else if (ch == '}' && !stack.isEmpty() && stack.peek() == '{') {
stack.pop();
} else if (ch == ']' && !stack.isEmpty() && stack.peek() == '[') {
stack.pop();
} else {
return false;
}
}
return stack.isEmpty();
}
}