✅ One Line Solution
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)\n\n# Code #1\nTime complexity: O(nk). Space complex
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)\n\n# Code #1\nTime complexity: $$O(n*k)$$. Space complexity: $$O(n*k)$$. n - num of words, k - word len.\n```python3\nclass Solution:\n    def uncommonFromSentences(self, s: str, t: str) -> List[str]:\n        return [w for w,f in Counter((s+\' \'+t).split()).items() if f<2]\n```\n\n# Code #2\nTime complexity: $$O(n*k)$$. Space complexity: $$O(n*k)$$.\n```python3\nclass Solution:\n    def uncommonFromSentences(self, s: str, t: str) -> List[str]:\n        return (p:={*(q:=(s+\' \'+t).split())})-{*Counter(q)-Counter(p)}\n```\n\n# Code #3\nTime complexity: $$O(n^2*k^2)$$. Space complexity: $$O(n*k)$$.\n```python3\nclass Solution:\n    def uncommonFromSentences(self, s: str, t: str) -> List[str]:\n        return filter(lambda w:q.count(w)<2,q:=(s+\' \'+t).split())\n```\n\n(Disclaimer 2: code above is just a product of fantasy packed into one line, it is not claimed to be \'true\' oneliners - please, remind about drawbacks only if you know how to make it better)
['Hash Table', 'String', 'Counting', 'Python', 'Python3']