text: #
  # @lc app=leetcode id=884 lang=python3
  #
  # [884] Uncommon Words from Two Sentences
  #
  # https://leetcode.com/problems/uncommon-words-from-two-sentences/description/
  #
  # algorithms
  # Easy (61.43%)
  # Likes:    335
  # Dislikes: 76
  # Total Accepted:    46.3K
  # Total Submissions: 74.7K
  # Testcase Example:  '"this apple is sweet"\n"this apple is sour"'
  #
  # We are given two sentences A and B.  (A sentence is a string of space
  # separated words.  Each word consists only of lowercase letters.)
  # 
  # A word is uncommon if it appears exactly once in one of the sentences, and
  # does not appear in the other sentence.
  # 
  # Return a list of all uncommon words. 
  # 
  # You may return the list in any order.
  # 
  # 
  # 
  # 
  # 
  # 
  # 
  # Example 1:
  # 
  # 
  # Input: A = "this apple is sweet", B = "this apple is sour"
  # Output: ["sweet","sour"]
  # 
  # 
  # 
  # Example 2:
  # 
  # 
  # Input: A = "apple apple", B = "banana"
  # Output: ["banana"]
  # 
  # 
  # 
  # 
  # Note:
  # 
  # 
  # 0 <= A.length <= 200
  # 0 <= B.length <= 200
  # A and B both contain only spaces and lowercase letters.
  # 
  # 
  # 
  # 
  #
  
  # @lc code=start
  from collections import Counter
  class Solution:
      def uncommonFromSentences(self, A: str, B: str) -> List[str]:
          ac = Counter(A.split())
          bc = Counter(B.split())
          ans = []
          uniq = set(list(ac.keys())+list(bc.keys()))
          for c in uniq:
              if ac[c]+bc[c]==1:
                  ans.append(c)
          return ans
  # @lc code=end
  
  