🤯 CRAZY ONE-LINE SOLUTION WITH EXPLANATION
Approach\n\n1. paths\n\n    \n    [\n        ["London", "New York"],\n        ["New York", "Lima"],\n        ["Lima", "Sao Paulo"]\n    ]   \n\n\n2. zip(*paths)
# Approach\n\n1. `paths`\n\n    ```\n    [\n        ["London", "New York"],\n        ["New York", "Lima"],\n        ["Lima", "Sao Paulo"]\n    ]   \n    ```\n\n2. `zip(*paths)`\n\n    ```\n    [\n        ["London", "New York", "Lima"], \n        ["New York", "Lima", "Sao Paulo"]\n    ]\n    ```\n\n3. `map(set, zip(*paths))`\n\n    ```\n    [\n        {"London", "New York", "Lima"}, \n        {"New York", "Lima", "Sao Paulo"}\n    ]\n    ```\n\n4. `reduce(lambda x, y: y - x, map(set, zip(*paths)))`\n\n    ```\n    {"New York", "Lima", "Sao Paulo"} \n    - {"London", "New York", "Lima"} \n    = {"Sao Paulo"}\n    ```\n\n5. `reduce(lambda x, y: y - x, map(set, zip(*paths))).pop()`\n\n    ```\n    "Sao Paulo"\n    ```\n\n# Complexity\n- Time complexity: $$O(N)$$\n\n- Space complexity: $$O(N)$$\n\n# Code\n```\nclass Solution:\n    def destCity(self, paths: List[List[str]]) -> str:\n        return reduce(lambda x, y: y - x, map(set, zip(*paths))).pop()\n```
['Hash Table', 'String', 'Python3']