1547. Destination City
My accepted Python solution to LeetCode problem 1547, Destination City, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.3MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.3MB, accepted 2025-12-29.
class Solution:
def destCity(self, paths: List[List[str]]) -> str:
sources = set(path[0] for path in paths)
for path in paths:
if path[1] not in sources:
return path[1]