Count Unreachable Pairs of Nodes in an Undirected Graph - (using DSU) | Graph Concepts & Qns - 23
Hi Everyone, this is the 23rd video of our Playlist "Graph Concepts & Qns".
In video-18, and video-19, we understood a very important topic in Graph "Disjoint Set Union (DSU)"
Now, it's time to solve Qn on DSU and get a good grip on it.
So, today we will solve a very good Qn "Count Unreachable Pairs of Nodes in an Undirected Graph".
Problem Name : Count Unreachable Pairs of Nodes in an Undirected Graph
Topic : Graph
Video : 23
Company Tags : MICROSOFT
My Code on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/Disjoint%20Set/Count%20Unreachable%20Pairs%20of%20Nodes%20in%20an%20Undirected%20Graph.cpp
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
My Graph Playlist : https://www.youtube.com/watch?v=0X0lEtTkk-8&list=PLpIkg8OmuX-LZB9jYzbbZchk277H5CbdY&index=20
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish