title: Find Expression Duplicate Parenthesis Not
signature: pub fn find_expression_duplicate_parenthesis_not(string_arg0: String) -> bool {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: bool, expected: bool)->bool{
  return actual==expected
  }
  pub fn driver(string_arg0: String, expected: bool)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(string_arg0), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        "((a+b)+((c+d)))".to_string(), 
        true
      ));
      
      println!("TEST-1...{}", driver(
        "(((a+(b)))+(c+d))".to_string(), 
        true
      ));
      
      println!("TEST-2...{}", driver(
        "(((a+(b))+c+d))".to_string(), 
        true
      ));
      
      println!("TEST-3...{}", driver(
        "((a+b)+(c+d))".to_string(), 
        false
      ));
      
      println!("TEST-4...{}", driver(
        "(8582007)".to_string(), 
        false
      ));
      
      println!("TEST-5...{}", driver(
        "((a+(b))+(c+d))".to_string(), 
        false
      ));
      
      println!("TEST-6...{}", driver(
        "(PylsShEdKAE)".to_string(), 
        false
      ));
      
      println!("TEST-7...{}", driver(
        "886980680541".to_string(), 
        false
      ));
      
      println!("TEST-8...{}", driver(
        "001".to_string(), 
        false
      ));
      
      println!("TEST-9...{}", driver(
        "jsVmFeOq".to_string(), 
        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;
  }