title: Find Expression Duplicate Parenthesis Not
signature: def findExpressionDuplicateParenthesisNot(string_arg0: String) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Boolean , expected: Boolean): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(string_arg0: String, expected: Boolean): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(string_arg0),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        "((a+b)+((c+d)))", 
        true    
      )}")   
  
  
      println(s"TEST-1...${driver(
        "(((a+(b)))+(c+d))", 
        true    
      )}")   
  
  
      println(s"TEST-2...${driver(
        "(((a+(b))+c+d))", 
        true    
      )}")   
  
  
      println(s"TEST-3...${driver(
        "((a+b)+(c+d))", 
        false    
      )}")   
  
  
      println(s"TEST-4...${driver(
        "(8582007)", 
        false    
      )}")   
  
  
      println(s"TEST-5...${driver(
        "((a+(b))+(c+d))", 
        false    
      )}")   
  
  
      println(s"TEST-6...${driver(
        "(PylsShEdKAE)", 
        false    
      )}")   
  
  
      println(s"TEST-7...${driver(
        "886980680541", 
        false    
      )}")   
  
  
      println(s"TEST-8...${driver(
        "001", 
        false    
      )}")   
  
  
      println(s"TEST-9...${driver(
        "jsVmFeOq", 
        false    
      )}")   
  
  }
  
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;
  }