title: Find Expression Duplicate Parenthesis Not
signature: function findExpressionDuplicateParenthesisNot(string_arg0) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(string_arg0, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(string_arg0),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver("((a+b)+((c+d)))", true);
    console.log(`TEST-0...${result}`);
  
    result = driver("(((a+(b)))+(c+d))", true);
    console.log(`TEST-1...${result}`);
  
    result = driver("(((a+(b))+c+d))", true);
    console.log(`TEST-2...${result}`);
  
    result = driver("((a+b)+(c+d))", false);
    console.log(`TEST-3...${result}`);
  
    result = driver("(8582007)", false);
    console.log(`TEST-4...${result}`);
  
    result = driver("((a+(b))+(c+d))", false);
    console.log(`TEST-5...${result}`);
  
    result = driver("(PylsShEdKAE)", false);
    console.log(`TEST-6...${result}`);
  
    result = driver("886980680541", false);
    console.log(`TEST-7...${result}`);
  
    result = driver("001", false);
    console.log(`TEST-8...${result}`);
  
    result = driver("jsVmFeOq", false);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
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;
  }