title: Find Expression Duplicate Parenthesis Not
signature: findExpressionDuplicateParenthesisNot(string_arg0) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(bool actual, bool expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(string_arg0, bool expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(string_arg0), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          "((a+b)+((c+d)))", 
          true)
      }");
  
      print("TEST-1...${driver(
          "(((a+(b)))+(c+d))", 
          true)
      }");
  
      print("TEST-2...${driver(
          "(((a+(b))+c+d))", 
          true)
      }");
  
      print("TEST-3...${driver(
          "((a+b)+(c+d))", 
          false)
      }");
  
      print("TEST-4...${driver(
          "(8582007)", 
          false)
      }");
  
      print("TEST-5...${driver(
          "((a+(b))+(c+d))", 
          false)
      }");
  
      print("TEST-6...${driver(
          "(PylsShEdKAE)", 
          false)
      }");
  
      print("TEST-7...${driver(
          "886980680541", 
          false)
      }");
  
      print("TEST-8...${driver(
          "001", 
          false)
      }");
  
      print("TEST-9...${driver(
          "jsVmFeOq", 
          false)
      }");
  
      return 0;
  }
source_py: def find_expression_duplicate_parenthesis_not(string):
      Stack = []
      for ch in string:
          if (ch == ')'):
              top = Stack.pop()
              elementsInside = 0
              while (top != '('):
                  elementsInside += 1
                  top = Stack.pop()
              if (elementsInside < 1):
                  return True
          else:
              Stack.append(ch)
      return False
source_cpp: bool find_expression_duplicate_parenthesis_not(string str) {
    stack < char > Stack;
    for ( char ch : str ) {
      if ( ch == ')' ) {
        char top = Stack . top ( );
        Stack . pop ( );
        int elementsInside = 0;
        while ( top != '(' ) {
          elementsInside ++;
          top = Stack . top ( );
          Stack . pop ( );
        }
        if ( elementsInside < 1 ) {
          return 1;
        }
      }
      else Stack . push ( ch );
    }
    return false;
  }