title: Find Expression Duplicate Parenthesis Not
signature: bool findExpressionDuplicateParenthesisNot(string string_arg0) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(bool actual, bool expected){
      return actual == expected;
  }
  
  string driver(string string_arg0, bool expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(string_arg0), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver("((a+b)+((c+d)))", true); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver("(((a+(b)))+(c+d))", true); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver("(((a+(b))+c+d))", true); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver("((a+b)+(c+d))", false); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver("(8582007)", false); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver("((a+(b))+(c+d))", false); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver("(PylsShEdKAE)", false); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver("886980680541", false); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver("001", false); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver("jsVmFeOq", false); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      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;
  }