input: def check_balanced_parens(strings):
      '''
      Given a list containing two strings, both made up of only '(' and ')'.
      Your task is to determine if there exists an order to concatenate these two
      strings such that the resulting string is balanced.
      A balanced string means that every opening parenthesis '(' has a corresponding
      closing parenthesis ')'. For instance: the string '(())()' is balanced, whereas
      the string '())' is not.
      Return 'Yes' if it is possible to form a balanced string, otherwise return 'No'.
  
      Examples:
      check_balanced_parens(['()(', ')']) == 'Yes'
      check_balanced_parens([')', ')']) == 'No'
      '''
output:     
      def is_balanced(s):
          count = 0
          for char in s:
              if char == '(':
                  count += 1
              else:
                  count -= 1
              if count < 0:
                  return False
          return count == 0
      
      a, b = strings
      
      if is_balanced(a + b) or is_balanced(b + a):
          return 'Yes'
      else:
          return 'No'
  