Do it for FUN | SUMFIのBlog

[Hacker Earth] Grid of Many Xors 2023-12-15|PSHacker Earth|Problem Solving-Greedy-Union Find

[Hacker Earth] Killjee And Saraff 2023-12-15|PSHacker Earth|Lowest Common Ancestor-Problem Solving-Sieve of Eratosthenes

Killjee And Saraff

[Hacker Earth] Queensland and Schools 2023-12-15|PSHacker Earth|Problem Solving-Knapsack

Queensland and Schools

[Hacker Earth] Monk and Chocolates 2023-12-15|PSHacker Earth|Sorting-Problem Solving-Two Pointer-Greedy

Monk and Chocolates

[Hacker Earth] Naruto`s Punishment 2023-12-15|PSHacker Earth|Problem Solving

Naruto’s Punishment

[LeetCode] Destination City 2023-12-15|PSLeetCode|Problem Solving

1436. Destination City

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.