Merge branch 'tasks-3375-3378' of github.com:jscrdev/Leetcode-in-java into tasks-3375-3378

Author: javadev

src/main/java/g3301_3400/s3378_count_connected_components_in_lcm_graph/Solution.java

@@ -25,13 +25,13 @@ public int find(int u) {
             if (parent[u] == u) {
                 return u;
             }
-            return parent[u] = find(parent[u]);
+            parent[u] = find(parent[u]);
+            return parent[u];
         }
 
         public void union(int u, int v) {
             int parentU = find(u);
             int parentV = find(v);
-
             if (parentU != parentV) {
                 totalComponents--;
                 if (rank[parentU] == rank[parentV]) {