Python Elegant & Short | 1-Line
Complexity
Time complexity: O(n∗m)
Space complexity: O(m)
Code
# Complexity
- Time complexity: $$O(n*m)$$
- Space complexity: $$O(m)$$

# Code
```python3 []
from functools import reduce
from operator import and_


class Solution:
    def intersection(self, arrays: list[list[int]]) -> list[int]:
        return sorted(reduce(and_, map(set, arrays)))

```
['Hash Table', 'Sorting', 'Python', 'Python3']