💥💥💥smart solution using set() and hashmap in very readable code💯💯💯
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        check = set()\n        d = {}\n        for city,dist in paths:\n            check.add(city)\n            check.add(dist)\n            d[city] = dist\n\n        for city in check:\n            try:\n                d[city]\n            except:\n                return city\n\n\n```
['Hash Table', 'Python3']