Back by popular demand... a ⭐ new learning explore card⭐! Go check out Detailed Explanation of Graph!

In this learning card, we'll cover data structures and algorithms related to “Graph”. With high-quality 30 articles, 38 videos, and 18 sample code, we visually explain the concept of several data structures and algorithms. After learning the concept, we provide some LeetCode problems for you to practice on and a video explanation to demonstrate how to apply the learned concept to the problem.

The content is exclusive to our premium users. Not a premium user yet? Click 🔸 HERE🔸 to upgrade and unlock all the premium learning resources on LeetCode!

Don't forget to share your progress with us on social media! Take the screenshot of your learning progress or share your learning notes, and use the hashtag #LearnwithLC on Linkedin, Twitter, and/or Instagram!

For those who are interested in what data structure and algorithms we covered in this learning card, check out the chapters! ⬇️

• Introduction to Graph
• Disjoint Set (8 videos 🎥 )
  • Introduction to Disjoint Set
  • Quick Find - Disjoint Set
  • Quick Union - Disjoint Set
  • Union by Rank - Disjoint Set
  • Path Compression Optimization - Disjoint Set
  • Optimized "Disjoint Set" with Path Compression and Union by Rank
  • Summary of the "Disjoint Set" Data Structure
  • LeetCode Practice Problem
    • Explanation to the LeetCode Practice Problem
• The Depth First Search Algorithm in Graph (3 videos 🎥 )
  • Overview of Depth First Search
  • Traversing all Vertices – Depth First Search Algorithm
  • Traversing all paths between two vertices – Depth-First Search Algorithm
  • LeetCode Practice Problem
    • Explanation to the LeetCode Practice Problem
• The Breadth First Search Algorithm in Graph (3 videos 🎥 )
  • Overview of Breadth First Search
  • Traversing all Vertices - Breadth First Search
  • Shortest Path Between Two Vertices - Breadth First Search
  • LeetCode Practice Problem
    • Explanation to the LeetCode Practice Problem
• Algorithms to Construct Minimum Spanning Tree (9 videos 🎥 )
  • Overview of Minimum Spanning Tree
  • Cut Property
  • Kruskal’s Algorithm
  • LeetCode Practice Problem
    • Explanation to the LeetCode Practice Problem
  • Prim’s Algorithm
  • LeetCode Practice Problem
    • Explanation to the LeetCode Practice Problem
• Single Source Shortest Path Algorithm (13 videos 🎥 )
  • Overview of Single Source Shortest Path
  • Dijkstra's Algorithm
  • LeetCode Practice Problem
    • Explanation to the LeetCode Practice Problem
  • Bellman Ford Algorithm
  • Improved Bellman-Ford Algorithm with Queue — SPFA Algorithm
  • LeetCode Practice Problem
    • Explanation to the LeetCode Practice Problem
• Kahn's Algorithm for Topological Sorting (2 videos 🎥 )
  • Overview of Kahn's Algorithm
  • LeetCode Practice Problem
    • Explanation to the LeetCode Practice Problem

New to our explore section? You are missing out on a great learning resource! 📇
Explore is a well-organized tool that helps you get the most out of LeetCode by providing structure to guide your progress towards the next step in your programming career.

Cards in the explore section are categorized into 3 topics.

Company Interview Card - We’ve compiled the Interview Cards with top interview questions that were asked by specific companies and organized the problems with different topics, so you can save time and get well-prepared for your interview with a more structural approach to prepare interview.

Learn Card - These “Introduction to…” cards are professionally curated guides and focus on a hands-on learning approach. With easy-to-understand explanations accompanied by high-quality visualizations, you’ll understand core concepts and further solidify the knowledge with question practices.

Check out our REAL user feedback on Deatailed Explanation of Graph!