Topological Sorting - GeeksforGeeks

Lecture 14: Depth-First Search (DFS), Topological Sort | Introduction to Algorithms | Electrical Engineering and Computer Science | MIT OpenCourseWare

Ankit Patel on Instagram: "🌟 Day 82 — Code With Akki > Ek tu hi hai bas, jisko sab kuch batane ka kabhi regret nahi hua... Thank you for listening 🤍✨ 📘 Topic: Graph — Part 2 (BFS & DFS Traversal) 💡 Concept Recap: 🔹 BFS (Breadth-First Search) — Traverses level by level using a queue. ➡️ Great for finding the shortest path in unweighted graphs. 🔹 DFS (Depth-First Search) — Traverses depth-wise using a stack (or recursion). ➡️ Useful for cycle detection, path checking, and topological sorting

Satyam Jyottsana gargee on Instagram: "Here I’m sharing that will solve 90% of your problem in DSA Month 1: Arrays & Strings Arrays: Two pointers, sliding window, prefix sums, subarrays, sorting Strings: Hashing, palindrome, substring search, two pointers — Month 2: Linked Lists & Stacks/Queues Linked Lists: Fast & slow pointers, reversal, merge/intersection Stacks/Queues: Monotonic stack, min/max stack, queue simulation — Month 3: Trees BFS, DFS, recursion Binary Search Tree (BST) Tree diameter