Day 113.java

import java.util.*;

class Solution {
    public static boolean checkRedundancy(String s) {
        Stack<Character> stack = new Stack<>();
        
        for (char ch : s.toCharArray()) {
            if (ch == ')') {
                boolean hasOperator = false;
                
                while (!stack.isEmpty() && stack.peek() != '(') {
                    char top = stack.pop();
                    if (top == '+' || top == '-' || top == '*' || top == '/') {
                        hasOperator = true;
                    }
                }
                
                if (!stack.isEmpty()) stack.pop();
                
                if (!hasOperator) return true;
            } else {
                stack.push(ch);
            }
        }
        
        return false;
    }
}