Adding the solution of Graph Connectivity With Threshold (#120)

* Added a new Leetcode Problem 1627

* Resolving bug in readme

Author: SauravP97

Java/graph_connectivity_with_threshold.java

@@ -0,0 +1,66 @@
+/** 
+ *  Problem Name : Graph Connectivity with Threshold
+ *  Concept Involved : Disjoint Union Set, Seive
+ * 
+ *  Execution Time : 16 ms
+ *  Memory Consumed : 92.7 mb
+ * 
+*/
+class Solution {
+    public static class Dus {
+        int[] parent;
+        int n;
+
+        Dus(int n) {
+            this.n = n;
+            parent = new int[n];
+            for (int i = 1; i < n; i++) {
+                parent[i] = i;
+            }
+        }
+
+        public int find(int u) {
+            if (u != parent[u]) {
+                parent[u] = find(parent[u]);
+            }
+            return parent[u];
+        }
+
+        public void union(int u, int v) {
+            int pu = find(u);
+            int pv = find(v);
+
+            if (pu != pv) {
+                parent[pv] = pu;
+            }
+        }
+    }
+    public List<Boolean> areConnected(int n, int threshold, int[][] queries) {
+        ArrayList<Boolean> res = new ArrayList<>();
+        Dus dus = new Dus(n+1);
+
+        for(int i=1; i<=n; i++){
+            for(int j=2*i; j<=n; j+=i){
+                if(i > threshold){
+                    dus.union(i,j);
+                }
+            }
+        }
+
+        for(int i=0; i<queries.length; i++){
+            int u = queries[i][0];
+            int v = queries[i][1];
+            int pu = dus.find(u);
+            int pv = dus.find(v);
+
+            if(pu == pv){
+                res.add(true);
+            }
+            else{
+                res.add(false);
+            }
+        }
+
+        return res;    
+    }
+}

README.md

@@ -371,6 +371,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite/)                                   | [C++](./C++/Is-Graph-Bipartite.cpp)                        | _O(V+E)_ | _O(V)_  | Medium     | Graph | BFS |
 | 947 | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/)                                   | [C++](./C++/Most-Stones-Removed-with-Same-Row-or-Column.cpp)         | _O(V)_ | _O(2V)_  | Medium     | Graph | Union Find |                                 | [C++](./C++/Most-Stones-Removed-with-Same-Row-or-Column.cpp)         | _O(V)_ | _O(2V)_  | Medium     | Graph | Union Find |
 | 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)                                   | [C++](./C++/Course-Schedule-II.cpp)                        | _O(V+E)_ | _O(V)_  | Medium     | Graph | BFS |
+| 1627 | [Graph Connectivity with Threshold](https://leetcode.com/problems/graph-connectivity-with-threshold/)                                   | [Java](./Java/graph_connectivity_with_threshold.java)                        | _O(V.logV + Q)_ | _O(V)_  | Hard     | Graph | Union Find + Sieve |
 <br/>
 <div align="right">
     <b><a href="#algorithms">⬆️ Back to Top</a></b>
@@ -434,7 +435,7 @@ DISCLAIMER: This above mentioned resources have affiliate links, which means if
 | [James Y](https://github.com/jameszu) <br> <img src="https://avatars0.githubusercontent.com/u/41566813?s=400&u=af77d15517566ea590a316030b4a6d402b0041b6&v=4" width="100" height="100"> | New Zealand     | python                  | [Github](https://github.com/jameszu) |
 | [Hamza B](https://github.com/9Hamza) <br> <img src="https://avatars2.githubusercontent.com/u/56516922?s=400&u=2c1adeef0194a2859361d464f28783bfba698638&v=4" width="100" height="100"> | Saudi Arabia     | Java                 | [Github](https://github.com/9Hamza) |
 | [Meli Haktas](https://github.com/MercerFrey) <br> <img src="https://avatars1.githubusercontent.com/u/29127873?s=460&u=149319db4468ec2316e49a75eb5e05b35eb05eef&v=4" width="100" height="100"> | Turkey     | python                  | [Github](https://github.com/MercerFrey) |
-
+| [Saurav Prateek](https://github.com/SauravP97) <br> <img src="https://avatars3.githubusercontent.com/u/26816418?s=460&u=4b5222d5b6db79389efba062714c9dfba263732f&v=4" width="100" height="100"> | India     | Java                  | [Github](https://github.com/SauravP97) |
 <br/>
 <div align="right">
     <b><a href="#algorithms">⬆️ Back to Top</a></b>