input: def check_parentheses(strings):
      '''
      Given a list containing exactly two strings made up of only '(' and ')'.
      Determine whether you can concatenate the two strings in some sequence to form a balanced string.
      A balanced string has every opening parenthesis paired and closed correctly, like '(())()', unlike '())'.
      Return 'Yes' if such a concatenation is possible, otherwise return 'No'.
  
      Examples:
      check_parentheses(['()(', ')']) == 'Yes'
      check_parentheses([')', ')']) == 'No'
      '''
output:     s1 = strings[0]
      s2 = strings[1]
      
      # Try concatenating s1 followed by s2
      combined1 = s1 + s2
      if is_balanced(combined1):
          return 'Yes'
      
      # Try concatenating s2 followed by s1
      combined2 = s2 + s1
      if is_balanced(combined2):
          return 'Yes'
      
      return 'No'
  
  def is_balanced(s):
      balance = 0
      for char in s:
          if char == '(':
              balance += 1
          elif char == ')':
              balance -= 1
          if balance < 0:
              return False
      return balance == 0