input: def check_balanced_parens(strings):
      '''
      Given a list containing two strings composed solely of opening '(' and 
      closing ')' parentheses, determine if by concatenating these strings in 
      any order, a balanced parentheses string can be formed.
      A string is considered balanced if each opening parenthesis has a corresponding
      closing parenthesis and the pairs are correctly nested. For instance, '(())()' 
      is balanced, whereas '())' is not.
      Return 'Yes' if a balanced string is possible, otherwise return 'No'.
  
      Examples:
      check_balanced_parens(['()(', ')']) == 'Yes'
      check_balanced_parens([')', ')']) == 'No'
      '''
output:     open_count = 0
      close_count = 0
      for s in strings:
          open_count += s.count('(')
          close_count += s.count(')')
      if open_count != close_count:
          return 'No'
      balance = 0
      for s in strings:
          for char in s:
              if char == '(':
                  balance += 1
              elif char == ')':
                  balance -= 1
              if balance < 0:
                  return 'No'
      return 'Yes'