Practice Destination City
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given the array paths, where paths[i] = [cityAi, cityBi] means there exists a direct path going from cityAi to cityBi. Return the destination city, that is, the city without any path outgoing to another city. It is guaranteed that the graph of paths forms a line without any loop, therefore, there will be exactly one destination city.
Source: Destination City on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
paths = [["London","New York"],["New York","Lima"],["Lima","Sao Paulo"]]
Output
"Sao Paulo"
# Example 2
Input
paths = [["B","C"],["D","B"],["C","A"]]
Output
"A"
# Example 3
Input
paths = [["A","Z"]]
Output
"Z"
Constraints
1 <= paths.length <= 100
paths[i].length == 2
1 <= cityAi.length, cityBi.length <= 10
cityAi != cityBi
All strings consist of lowercase and uppercase English letters and the space character.
Related LeetCode Problems
Practice more problems similar to Destination City.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.