Count the Number of Complete Components | Multiple Approaches | Leetcode 2685 | codestorywithMIK

Subscribers:
92,300
Published on ● Video Link: https://www.youtube.com/watch?v=7b7GbuFMWRw



Duration: 0:00
5,844 views
348


Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A

Disjoint Set Union -    • Disjoint Set Union | DSU | Graph Conc...  
Disjoint Set Union By Rank and Path Compression -    • Disjoint Set Union By Rank and Path C...  
Disjoint Set Union By SIZE and Path Compression -    • Disjoint Set Union By SIZE and Path C...  

Hi Everyone, this is the 71st video of our Playlist "Graphs : Popular Interview Problems".
Now we will be solving a good Graph practice problem - Count the Number of Complete Components | Multiple Approaches | Leetcode 2685 | codestorywithMIK

We will focus on why this is a Graph based problem and why Topological Sort is the ideal approach for this problem.


Problem Name : Count the Number of Complete Components | Multiple Approaches | Leetcode 2685 | codestorywithMIK
Company Tags : AMAZON
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/Disjoint Set/Count the Number of Complete Components.cpp
Leetcode Link : https://leetcode.com/problems/count-the-number-of-complete-components


My DP Concepts Playlist :    • Roadmap for DP | How to Start DP ? | ...  
My Graph Concepts Playlist :    • Graph Concepts & Qns - 1 : Graph will...  
My Segment Tree Concepts Playlist :    • Segment Tree | Introduction | Basics ...  
My Recursion Concepts Playlist :    • Introduction | Recursion Concepts And...  
Trie Playlist -    • Word Search II (Google, Amazon, Meta,...  
Difference Array Technique: Concepts & Qns :    • Introduction | What | How | Differenc...  
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Subscribe to my channel :    / @codestorywithmik  

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝


Video Summary :
DFS Approach: This method uses Depth-First Search to traverse the graph and count the number of vertices and edges in each connected component. It then checks if the component forms a complete subgraph by verifying the number of edges.

BFS Approach: This method replaces DFS with Breadth-First Search using a queue. It explores each component level by level, tracking the number of vertices and edges. The completeness condition is checked similarly to the DFS approach.

DSU Approach: This method utilizes Disjoint Set Union (Union-Find) to group connected components efficiently. After forming components, it counts edges within each set and verifies if they satisfy the complete graph condition.


✨ Timelines✨
00:00 - Introduction
0:27 - Motivation
0:52 - Problem Explanation
5:04 - What is Complete Graph ?
9:15 - Approach-1 (DFS)
18:32 - Coding DFS
22:40 - Approach-2 (BFS)
24:32 - Coding BFS
26:37 - Approach-3 (DSU by Size)
40:31 - Coding DSU by Size

#MIK #mik #Mik
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #coding #programming #100daysofcode #developers #techjobs #datastructures #algorithms #webdevelopment #softwareengineering #computerscience #pythoncoding #codinglife #coderlife #javascript #datascience #leetcode #leetcodesolutions #leetcodedailychallenge #codinginterview #interviewprep #technicalinterview #interviewtips #interviewquestions #codingchallenges #interviewready #dsa #hindi #india #hindicoding #hindiprogramming #hindiexplanation #hindidevelopers #hinditech #hindilearning #helpajobseeker #jobseekers #jobsearchtips #careergoals #careerdevelopment #jobhunt #jobinterview #github #designthinking #learningtogether #growthmindset #digitalcontent #techcontent #socialmediagrowth #contentcreation #instagramreels #videomarketing #codestorywithmik #codestorywithmick #codestorywithmikc #codestorywitmik #codestorywthmik #codstorywithmik #codestorywihmik #codestorywithmiik #codeistorywithmik #codestorywithmk #codestorywitmick #codestorymik #codestorwithmik




Other Videos By codestorywithMIK


2025-03-29Partition Labels | 2 Clean Approaches | Leetcode 763 | codestorywithMIK
2025-03-29Apply Operations to Maximize Score | Super Detailed Approach For Beginners | Leetcode 2818 | MIK
2025-03-28Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK
2025-03-27Find the K-th Largest or Smallest in O(n) using nth_element | Competitive Programming Hack
2025-03-26Minimum Index of a Valid Split | 2 Approaches | Leetcode 2780 | codestorywithMIK
2025-03-25Minimum Operations to Make a Uni-Value Grid | Detailed Simple Maths Proof | Leetcode 2033 | MIK
2025-03-24Check if Grid can be Cut into Sections | Merge Intervals | Leetcode 3394 | Leetcode 56 | Detailed
2025-03-23Count Days Without Meetings | Simplest Explanation | Leetcode 3169 | codestorywithMIK
2025-03-22Number of Ways to Arrive at Destination | Straight Forward Simple | Leetcode 1976 | codestorywithMIK
2025-03-22Why I Will NEVER Promote Paid DSA Courses! 🚫 The Truth You Need to Know | codestorywithMIK
2025-03-21Count the Number of Complete Components | Multiple Approaches | Leetcode 2685 | codestorywithMIK
2025-03-21Find All Possible Recipes from Given Supplies | Brute Force | Optimal | Leetcode 2115
2025-03-17Longest Nice Subarray | Brute Force | Better | Optimal | Dry Runs | Leetcode 2401 | codestorywithMIK
2025-03-16Divide Array Into Equal Pairs | 5 Approaches | Leetcode 2206 | codestorywithMIK
2025-03-15Minimum Time to Repair Cars | With Minute Details | Leetcode 2594 | codestorywithMIK
2025-03-14House Robber IV | Brute Force | Optimal | Leetcode 2560 | codestorywithMIK
2025-03-14DSA Shorts with MIK - 11 | Avoid TLE in Competitive Programming with Fast I/O 🔥 | Part 2
2025-03-13Maximum Candies Allocated to K Children | Brute Force | Optimal | Leetcode 2226 | codestorywithMIK
2025-03-12Zero Array Transformation II | Brute Force | Better | Leetcode 3356 | codestorywithMIK
2025-03-11Maximum Count of Positive Integer and Negative Integer | Leetcode 2529 | codestorywithMIK
2025-03-10Number of Substrings Containing All Three Characters | Dry Runs | Leetcode 1358 | codestorywithMIK