title: Find Expression Duplicate Parenthesis Not
signature: findExpressionDuplicateParenthesisNot :: String -> Bool
  findExpressionDuplicateParenthesisNot string_arg0 = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Bool -> Bool -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: String -> Bool -> String
  driver string_arg0 expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME string_arg0) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver ("((a+b)+((c+d)))") (True) )
  
      printf "TEST-1...%s\n" (driver ("(((a+(b)))+(c+d))") (True) )
  
      printf "TEST-2...%s\n" (driver ("(((a+(b))+c+d))") (True) )
  
      printf "TEST-3...%s\n" (driver ("((a+b)+(c+d))") (False) )
  
      printf "TEST-4...%s\n" (driver ("(8582007)") (False) )
  
      printf "TEST-5...%s\n" (driver ("((a+(b))+(c+d))") (False) )
  
      printf "TEST-6...%s\n" (driver ("(PylsShEdKAE)") (False) )
  
      printf "TEST-7...%s\n" (driver ("886980680541") (False) )
  
      printf "TEST-8...%s\n" (driver ("001") (False) )
  
      printf "TEST-9...%s\n" (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;
  }