
Disjoint Set(level-3 )
1) Kruskal Algorithm to find minimum spanning tree #include <bits/stdc++.h> using namespace std; // -------- DSU Implementation -------- class DSU { vector<int> parent, rank; public: DSU(int n) { parent.resize(n); rank.resize...









