Java Solution for Maximum Gap

2 files changed, 42 insertions, 30 deletions

diff --git a/challenge-106/ziameraj16/README.md b/challenge-106/ziameraj16/README.md
index be300e1d0e..9edcaca8cb 100644
--- a/challenge-106/ziameraj16/README.md
+++ b/challenge-106/ziameraj16/README.md
@@ -1,42 +1,20 @@
-# Nth Root
+# Maximum Gap
 ## Java Solution
 
 To compile the code run
 ```java
-javac NthRoot.java
+javac MaximumGap.java
 ```
 To run
 ```java
-java NthRoot
+java MaximumGap
 ```
 ### Example
 ```bash
-/perlweeklychallenge-club/challenge-105/ziameraj16/java$ javac NthRoot.java
-/perlweeklychallenge-club/challenge-105/ziameraj16/java$ java NthRoot
-Enter value of N
-5
-Enter value of k
-248832
-12.00
+/perlweeklychallenge-club/challenge-106/ziameraj16/java$ javac MaximumGap.java
+/perlweeklychallenge-club/challenge-106/ziameraj16/java$ java MaximumGap
+Enter comma separated values
+2,9,3,5
+4
 ```
 
-## Kotlin Solution
-
-To compile the code run
-```java
-kotlinc NthRoot.kt
-```
-To run
-```java
-kotlin NthRoot
-```
-### Example
-```bash
-/perlweeklychallenge-club/challenge-105/ziameraj16/kotlin$ kotlinc NthRoot.kt
-/perlweeklychallenge-club/challenge-105/ziameraj16/kotlin$ kotlin NthRoot
-Enter value of N
-5
-Enter value of k
-34
-2.02
-```
diff --git a/challenge-106/ziameraj16/java/MaximumGap.java b/challenge-106/ziameraj16/java/MaximumGap.java
new file mode 100644
index 0000000000..e27af82a23
--- /dev/null
+++ b/challenge-106/ziameraj16/java/MaximumGap.java
@@ -0,0 +1,34 @@
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.List;
+import java.util.Scanner;
+import java.util.stream.Collectors;
+
+public class MaximumGap {
+
+    public static void main(String[] args) {
+        System.out.println("Enter comma separated values");
+        Scanner scanner = new Scanner(System.in);
+        String input = scanner.nextLine();
+        String[] arr = input.split(",");
+        List<Integer> list = Arrays.stream(arr).mapToInt(Integer::valueOf).boxed().collect(Collectors.toList());
+        System.out.println(findMaxGap(list));
+    }
+
+    private static int findMaxGap(List<Integer> list) {
+        if (list.size() == 1) {
+            return 0;
+        }
+        Collections.sort(list);
+        int maxDiff = Integer.MIN_VALUE;
+        int i = 0;
+        while (i < list.size() -1) {
+            final int diff = Math.abs(list.get(i + 1) - list.get(i));
+            if (diff > maxDiff) {
+                maxDiff = diff;
+            }
+            i++;
+        }
+        return maxDiff;
+    }
+}