DSA Python - Eventual Safe States | BFS | Reverse Graph + Topo Sort | LC 802 - Part 139 [Hindi]

Welcome to Part 139 of Code & Debug’s DSA Python Course 2025!

In this video, we solve Leetcode 802 - Find Eventual Safe States using a BFS + Topological Sort (Kahn’s Algorithm) approach.

Rather than the typical DFS, we flip the graph and apply Kahn’s algorithm to find terminal safe nodes – the ones that do not lead to any cycle.

🔍 In this video, you’ll learn:
✅ How to reverse a directed graph
✅ Using indegree calculation to find safe nodes
✅ Applying BFS with queue for topological processing
✅ Why we sort the final answer
✅ Full dry run & conceptual clarity
✅ Time & Space Complexity breakdown

This method is clean, fast, and a great way to understand how topological sorting helps in cycle detection and terminal node identification.

🔗 Leetcode 802 - Find Eventual Safe States:
https://leetcode.com/problems/find-ev...

👉 Refer to the article for better understanding:
🔗 https://codeanddebug.in/blog/find-eve...

📄 Full DSA YouTube Playlist (All questions in order):
🔗 https://docs.google.com/spreadsheets/...

🚀 Free Master DSA with Python Course:
🔗 https://codeanddebug.in/course/master...

💡 Self-Paced Advanced DSA Course (Zero to Hero):
🔗 https://codeanddebug.in/course/zero-t...

🎯 Don't forget to like, comment, and subscribe for more high-quality content from Code & Debug. Hit the 🔔 bell icon for instant notifications!

🎯 Perfect for:
Beginners & intermediate students aiming for placements, internships, and tech interviews!

💬 If you enjoyed this video, don’t forget to Like | Share | Comment and hit the 🔔 bell icon for more updates.

#EventualSafeStates #Leetcode802 #KahnsAlgorithm #TopologicalSort #GraphBFS #PythonDSA #CodeAndDebug #Part139 #DSACourse2025 #TerminalNodes #SafeNodes #CycleDetection #ReverseGraph #BFSInGraphs