DSA Python 2025 – Course Schedule I & II | Kahn’s Algo | Leetcode 207 & 210 – Part 138 [Hindi]

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

In this special video, we tackle two classic graph problems from Leetcode:
👉 Leetcode 207 – Course Schedule (Cycle Detection)
👉 Leetcode 210 – Course Schedule II (Topological Sort)

Using Kahn’s Algorithm, we detect whether all courses can be completed (Cycle Detection) and return the order of course completion (Topological Sort) if possible.

📚 What you’ll learn in this session:
✅ How to detect cycles in a directed graph
✅ Using Kahn’s Algorithm to solve Course Schedule problems
✅ Topological Sorting using BFS
✅ Real-world analogy of course prerequisites
✅ Step-by-step Python code explanation
✅ Time & Space Complexity Analysis

💡 These problems are frequently asked in interviews and are great for understanding graphs, indegrees, and dependency resolution.

🔗 Leetcode 207 – Course Schedule:
https://leetcode.com/problems/course-schedule/

🔗 Leetcode 210 – Course Schedule II:
https://leetcode.com/problems/course-schedule-ii/

👉 Refer to the article for better understanding:
🔗 https://codeanddebug.in/blog/course-schedule-1/

📄 Full Playlist Sheet (All Questions in Order):
https://docs.google.com/spreadsheets/d/1AWE15Fy3wD2iqu2vjK_R7cCiuvSsjYQclcdZmHpF66o/edit?usp=sharing

🎓 Enroll in the FREE Python DSA Course:
https://codeanddebug.in/course/master-dsa-with-leetcode

⚡ Join the Self-Paced Zero to Hero DSA Course:
https://codeanddebug.in/course/zero-to-hero-python-dsa

🙏 Like, Share & Subscribe to support Code & Debug and stay notified with the 🔔 bell icon!

#CourseSchedule #Leetcode207 #Leetcode210 #TopologicalSort #CycleDetection #KahnsAlgorithm #PythonDSA #DSA2025 #CodeAndDebug #Part138 #GraphProblems #TechInterviews