✅ 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.1 - Oneliner\nTime complexity: O(n). S
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)\n\n# Code #1.1 - Oneliner\nTime complexity: $$O(n)$$. Space complexity: $$O(n)$$.\n```\nclass Solution:\n    def minWindow(self, s: str, t: str) -> str:\n        return (g:={\'s\':s,\'t\':t,\'a\':0,\'c\':Counter(),\'d\':Counter(t),\'r\':[inf,\'\']}) and \\\n            all([setitem(g,\'b\',b),exec(\'c[s[b]]+=1\',g),exec(\'while c>=d:r=min(r,[b-a+1,s[a:b+1]]);c[s[a]]-=1;a+=1\',g)] for b in range(len(s))) and g[\'r\'][1]\n```\n\n# Code #1.2 - Unwrapped\n```\nclass Solution:\n    def minWindow(self, s: str, t: str) -> str:\n        a, c, d, r = 0, Counter(), Counter(t), [inf, \'\']\n        for b in range(len(s)):\n            c[s[b]] += 1\n            while c >= d:\n                r = min(r, [b-a+1, s[a:b+1]])\n                c[s[a]] -= 1\n                a += 1\n        \n        return r[1]\n```\n\n(Disclaimer 2: all code above is just a product of fantasy, it is not claimed to be pure impeccable oneliners - please, remind about drawbacks only if you know how to make it better. PEP 8 is violated intentionally)
['Hash Table', 'String', 'Sliding Window', 'Counting', 'Python', 'Python3']