98% faster easy python solution based on question no. 997
\nclass Solution:\n    def destCity(self, paths: List[List[str]]) -> str:\n        lst=[]\n        arr=[]\n        for i in paths:\n            lst.append(i[0])
```\nclass Solution:\n    def destCity(self, paths: List[List[str]]) -> str:\n        lst=[]\n        arr=[]\n        for i in paths:\n            lst.append(i[0])\n            arr.append(i[1])\n        ptr=set(lst)\n        ptr2=set(arr)\n        return list(ptr2-ptr)[0]\n```
['Ordered Set', 'Python', 'Python3']