Eezz Solulu without zip function
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n Initialize two sets dc
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n* Initialize two sets dc and ac to store destination cities and arrival cities, respectively.\n* Iterate through the paths list and add each city to the corresponding set (ac for arrival cities and dc for destination cities).\n* Find the destination city by calculating the set difference (dc - ac) and extracting the only element using pop().\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        dc , ac = set() , set()\n        for u,v in paths:\n            ac.add(u)\n            dc.add(v)\n        return (dc - ac).pop()\n```
['Python3']