2421. Number of Good Paths | LeetCode | C++

[@deepcodes]

class DSU { public: vectorrank; vectorparent; DSU(int n) { rank.resize(n); parent.resize(n); for (int i = 0; i < n; i++) { rank[i] = 0; parent[i] = i; } } int findParent(int x) { if (x == parent[x]) { return x; } return parent[x] = findParent(parent[x]); } void makeUnion(int x, int y) { int p1 = findParent(x), p2 = findParent(y); if (p1 != p2) { if (rank[p1] > rank[p2]) { parent[p2] = p1; rank[p1] += rank[p2]; } else { parent[p1] = p2; rank[p2] += rank[p1]; } } } };

[@arghyadas4138]

21:40 Yes I used both DFS and BFS but I got TLE

[@xd9050]

pls send the code , if it is in c++ :)

[@sadikulhaquesadi6003]

@ 13.40 how it became 3 is not clear..

[@deepcodes]

Frequency is 2, so applying the formula n*(n+1)/2 for n=2 will result in 3.