🔥 Day 30

Author: AkashRajpurohit

README.md

@@ -47,6 +47,7 @@
 ## Week 5 🚧
 
 1. [Pancake Sort](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/553/week-5-august-29th-august-31st/3441/) ➡️ [CPP Solution](Week5/pancakeSort.cpp)
+2. [Largest Component Size by Common Factor](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/553/week-5-august-29th-august-31st/3442/) ➡️ [CPP Solution](Week5/largestComponentSize.cpp)
 
 ## Other Challenges 💪
 

Week5/largestComponentSize.cpp

@@ -0,0 +1,45 @@
+class dsu{
+	public:
+	vector<int> arr;
+	dsu(int n):arr(n){
+		for(int i=0;i<n;i++){
+			arr[i]=i;
+		}
+	}
+
+	void merge(int a, int b){
+		arr[find(arr[a])]=arr[find(arr[b])];
+	}
+
+	int find(int x){
+		if(arr[x]!=x){
+			arr[x]=find(arr[x]);
+		}
+		return arr[x];
+	}
+};
+
+class Solution {
+
+public:
+	int largestComponentSize(vector<int>& A) {
+		int n=*max_element(A.begin(),A.end());
+		dsu DSU(n+1);
+		for(auto x:A){
+			int temp=sqrt(x);
+			for(int k=2;k<=temp;k++){
+				if(x%k==0){
+					DSU.merge(x,k);
+					DSU.merge(x,x/k);
+				}
+			}
+		}
+		unordered_map<int,int> m;
+		int res=1;
+		for(auto v:A){
+			m[DSU.find(v)]+=1;
+			res=max(res,m[DSU.find(v)]);
+		}
+		return res;
+	}
+};