Welcome to AlgoYogi!
🚀 Start Your Smart Coding Prep at 👉 https://algoyogi.io
In this video, we solve **LeetCode 1436: Destination City** using Python and a simple in-out counting approach.
Given a list of travel paths where each path is [from, to], we need to find the city that does not appear as a “from” in any path — that is the destination city.
Approach:
- Track “from” cities in a set.
- Track “to” cities in a set (or just process to find one not in from set).
- Among all “to” cities, return one that is not in “from” set.
👉 Problem Link: https://leetcode.com/problems/destination-city/description/
---
### ⏱ Timestamps
0:00 Introduction
0:20 Problem Statement
1:20 In-Out Set Counting Approach
7:30 Python Code Walkthrough
13:30 Time and Space Complexity
---
### 💡 Why Watch?
- Quick, elegant logic in O(n) time and O(n) space
- Illustrates the idea of sink node in directed edges
- Beginner-friendly but frequently asked
#LeetCode #DestinationCity #Python #AlgoYogi #Sets #GraphThinking
