✅ One Line Solution
Code #1\nTime complexity: O(m+kn). Space complexity: O(m). m and n are the lengths of a and w, k - max len of word.\npython3\nclass Solution:\n    def countCons
# Code #1\nTime complexity: $$O(m+k*n)$$. Space complexity: $$O(m)$$. $$m$$ and $$n$$ are the lengths of `a` and `w`, $$k$$ - max len of word.\n```python3\nclass Solution:\n    def countConsistentStrings(self, a: str, w: List[str]) -> int:\n        return sum(map({*a}.issuperset,w))\n```\n[Ref](https://leetcode.com/problems/count-the-number-of-consistent-strings/solutions/4035909/One-line-solution/)\n\n# Code #2\nTime complexity: $$O((m+k)*n)$$. Space complexity: $$O(m+k)$$.\n```python3\nclass Solution:\n    def countConsistentStrings(self, a: str, w: List[str]) -> int:\n        return sum({*a}>={*s} for s in w)\n```\n[Ref](https://leetcode.com/problems/count-the-number-of-consistent-strings/solutions/1054303/python-simple-one-liner)
['Array', 'Hash Table', 'String', 'Python', 'Python3']