Add new solutions for problems 20, 67, 1200, 1984, and 3516

Author: DarkSnakeX

src/main/java/me/darksnakex/problems/java/p1200.java

@@ -0,0 +1,46 @@
+package me.darksnakex.problems.java;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+public class p1200 {
+
+    public static List<List<Integer>> minimumAbsDifference(int[] arr) {
+
+
+        List<List<Integer>> listres =  new ArrayList<>();
+        int minact = 999999999;
+
+        Arrays.sort(arr);
+
+        for(int i = 0; i < arr.length-1; i++){
+
+            if(arr[i+1] - arr[i] <= minact){
+                if(arr[i+1] - arr[i] < minact){
+                    minact = arr[i+1] - arr[i];
+                    listres.clear();
+                }
+                List<Integer> listact = new ArrayList<>();
+                listact.add(arr[i]);
+                listact.add(arr[i+1]);
+                listres.add(listact);
+
+
+            }
+
+        }
+
+
+
+        return listres;
+    }
+
+
+    public static void main(String[] args){
+
+        minimumAbsDifference(new int[]{1,3,6,10,15});
+
+    }
+
+}

src/main/java/me/darksnakex/problems/java/p1984.java

@@ -0,0 +1,27 @@
+package me.darksnakex.problems.java;
+
+public class p1984 {
+
+    public int minimumDifference(int[] nums, int k) {
+
+        int res = 999999999;
+
+        if(nums.length == 1){
+            return 0;
+        }
+
+        for(int i = 0; i < nums.length; i++){
+
+            for(int j = i+1; j < k; j++){
+                if(Math.abs(nums[i]-nums[j]) < res){
+                    res = Math.abs(nums[i]-nums[j]);
+                }
+            }
+
+        }
+
+        return res;
+
+    }
+
+}

src/main/java/me/darksnakex/problems/java/p20.java

@@ -0,0 +1,53 @@
+package me.darksnakex.problems.java;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+import java.util.Stack;
+
+public class p20 {
+
+    public static boolean isValid(String s) {
+
+        Stack<Character> pila = new Stack<>();
+
+        if(s.length() % 2 != 0){
+            return false;
+        }
+
+        for(int i = 0; i < s.length(); i++){
+            if(s.charAt(i) == '('){
+                pila.push(')');
+            } else if (s.charAt(i) == '{') {
+                pila.push('}');
+            }
+            else if (s.charAt(i) == '[') {
+                pila.push(']');
+            } else if (pila.isEmpty() || pila.pop() != s.charAt(i)) {
+                return false;
+
+            }
+
+        }
+
+        return pila.isEmpty();
+
+    }
+
+
+
+
+    public static void main(String[] args){
+
+        System.out.println(isValid("()")); // bien
+        System.out.println("(]"); // mal
+        System.out.println("([])"); // bien
+        System.out.println("([)]"); // mal
+
+    }
+
+
+    
+}
+
+

src/main/java/me/darksnakex/problems/java/p3516.java

@@ -0,0 +1,15 @@
+package me.darksnakex.problems.java;
+
+public class p3516 {
+
+    public int findClosest(int x, int y, int z) {
+        int calc = Math.abs(x-z);
+        int calc2 = Math.abs(y-z);
+
+        if(calc == calc2) return 0;
+        if(calc < calc2) return 1;
+        return 2;
+
+    }
+
+}

src/main/java/me/darksnakex/problems/java/p67.java

@@ -0,0 +1,66 @@
+package me.darksnakex.problems.java;
+
+
+public class p67 {
+
+    public static String addBinary(String a, String b) {
+
+        StringBuilder res = new StringBuilder();
+        boolean bitacarreo = false;
+        int longitudm = Math.max(a.length(), b.length());
+
+
+        for(int i = 1; i <= longitudm; i++){
+
+            char cara;
+            if (a.length() - i >= 0) {
+                cara = a.charAt(a.length() - i);
+            } else {
+                cara = '0';
+            }
+
+            char carb;
+            if (b.length() - i >= 0) {
+                carb = b.charAt(b.length() - i);
+            } else {
+                carb = '0';
+            }
+
+            if(cara == '0' && carb == '0'){ // caso: 0+0
+                if(bitacarreo){
+                    res.append('1');
+                    bitacarreo=false;
+                }else {
+                    res.append('0');
+                }
+            }
+            else if((cara == '1' && carb == '0') || (cara == '0' && carb == '1')){ // caso: 0+1 o 1+0
+                if(bitacarreo){
+                    res.append('0');
+                }else {
+                    res.append('1');
+                }
+            } else if (cara == '1' && carb == '1') { // caso: 1+1
+                if(bitacarreo){
+                    res.append('1');
+                }else{
+                    res.append('0');
+                }
+                bitacarreo = true;
+            }
+
+
+        }
+
+        if(bitacarreo){
+            res.append('1');
+        }
+        return res.reverse().toString();
+
+    }
+
+    public static void main(String[] args){
+        System.out.println(addBinary("1010","1011"));
+        System.out.println(addBinary("11","1"));
+    }
+}