Java solution for Disjoint Sets

2 files changed, 39 insertions, 8 deletions

diff --git a/challenge-127/ziameraj16/README.md b/challenge-127/ziameraj16/README.md
index 90795db3f7..d374d250e5 100644
--- a/challenge-127/ziameraj16/README.md
+++ b/challenge-127/ziameraj16/README.md
@@ -1,19 +1,27 @@
-# Count Numbers
+# Disjoint Sets
 ## Java Solution
 
 To compile the code run
 ```java
-javac CountNumbers.java
+javac DisjointSets.java
 ```
 To run
 ```java
-java CountNumbers
+java DisjointSets
 ```
 ### Example
 ```bash
-/perlweeklychallenge-club/challenge-126/ziameraj16/java$ javac CountNumbers.java
-/perlweeklychallenge-club/challenge-126/ziameraj16/java$ java CountNumbers
-Enter the number
-15
-8
+/perlweeklychallenge-club/challenge-127/ziameraj16/java$ javac DisjointSets.java
+/perlweeklychallenge-club/challenge-127/ziameraj16/java$ java DisjointSets
+Enter comma separated list of numbers for that first set
+1,2,5,3,4
+Enter comma separate list of numbers for the second set
+4,6,7,8,9
+0
+/perlweeklychallenge-club/challenge-127/ziameraj16/java$ java DisjointSets
+Enter comma separated list of numbers for that first set
+1,3,5,7,9
+Enter comma separate list of numbers for the second set
+0,2,4,6,8
+1
 ```
diff --git a/challenge-127/ziameraj16/java/DisjointSets.java b/challenge-127/ziameraj16/java/DisjointSets.java
new file mode 100644
index 0000000000..3f74a64e5c
--- /dev/null
+++ b/challenge-127/ziameraj16/java/DisjointSets.java
@@ -0,0 +1,23 @@
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.List;
+import java.util.Scanner;
+import java.util.stream.Collectors;
+
+public class DisjointSets {
+
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        System.out.println("Enter comma separated list of numbers for that first set");
+        String[] arr1 = scanner.nextLine().split(",");
+        List<Integer> list1 = Arrays.stream(arr1).map(Integer::valueOf).collect(Collectors.toList());
+        System.out.println("Enter comma separate list of numbers for the second set");
+        String[] arr2 = scanner.nextLine().split(",");
+        List<Integer> list2 = Arrays.stream(arr2).map(Integer::valueOf).collect(Collectors.toList());
+        System.out.println(areDisjointSets(list1,list2));
+    }
+
+    private static int areDisjointSets(List<Integer> first, List<Integer> second) {
+        return Collections.disjoint(first, second) ? 1 : 0;
+    }
+}