Beats 92% with commented Easy Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def destCity(self, paths: List[List[str]]) -> str:\n        outgoing_cities = set()\n    \n        for path in paths:\n            outgoing_cities.add(path[0])  # outgoing_cities = {\'London\', \'New York\', \'Lima\'}. for path[0]\n        \n        for path in paths:\n            if path[1] not in outgoing_cities:\n                return path[1]  # it finds that \'Sao Paulo\' is not present in outgoing_cities, so it\'s the destination city.\n```
['Python3']