Add solutions for problems 771, 1108, 1470, 1512, 1672, 1689, 1769, 1929, 2011, 2044, 2469, 2807, 2942, 3190, and 3467

Author: DarkSnakeX

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

@@ -0,0 +1,9 @@
+package me.darksnakex.problems;
+
+public class p1108 {
+
+    public String defangIPaddr(String address) {
+        return address.replaceAll("\\.", "[.]");
+    }
+
+}

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

@@ -0,0 +1,21 @@
+package me.darksnakex.problems;
+
+public class p1470 {
+
+    public int[] shuffle(int[] nums, int n) {
+
+        int[] arr = new int[nums.length];
+
+        int m = 0;
+        for(int i = 0; i < arr.length; i+=2){
+            arr[i] = nums[m];
+            arr[i+1] = nums[n];
+            m++;
+            n++;
+        }
+
+        return arr;
+    }
+
+
+}

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

@@ -0,0 +1,23 @@
+package me.darksnakex.problems;
+
+public class p1512 {
+
+    public int numIdenticalPairs(int[] nums) {
+
+        int res = 0;
+        for(int i = 0; i < nums.length; i++){
+            int actual = nums[i];
+            for (int j = 0; j < nums.length; j++){
+                if(i < j && actual == nums[j]){
+                    res++;
+                }
+            }
+        }
+
+
+        return res;
+
+    }
+}
+
+

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

@@ -0,0 +1,27 @@
+package me.darksnakex.problems;
+
+public class p1672 {
+
+    public int maximumWealth(int[][] accounts) {
+
+        int actual = 0;
+        int max = 0;
+
+        for(int i = 0; i < accounts.length; i++){
+            for(int j = 0; j < accounts[i].length; j++){
+                actual+=accounts[i][j];
+            }
+            if(actual > max){
+                max = actual;
+            }
+            actual = 0;
+        }
+
+
+
+        return max;
+
+    }
+
+
+}

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

@@ -0,0 +1,41 @@
+package me.darksnakex.problems;
+
+public class p1689 {
+
+
+    public int minPartitions(String n) {
+
+        int actual = -1;
+
+        for(int i = 0; i<n.length(); i++){
+            if(actual < n.charAt(i)){
+                actual = n.charAt(i);
+            }
+        }
+
+        for(char car: n.toCharArray()){
+            if(actual < car){
+                actual = car;
+            }
+
+        }
+
+        return actual-48;
+    }
+
+    public int minPartitionsold(String n){
+
+        int actual = -1;
+
+        for(int i = 0; i<n.length(); i++){
+            if(actual < n.charAt(i)){
+                actual = n.charAt(i);
+            }
+        }
+
+        return actual-48;
+
+    }
+
+
+}

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

@@ -0,0 +1,22 @@
+package me.darksnakex.problems;
+
+public class p1769 {
+
+    public int[] minOperations(String boxes) {
+
+
+        int[] res = new int[boxes.length()];
+
+        for(int i = 0; i < boxes.length(); i++){
+            if(boxes.charAt(i) == '1') {
+                for (int j = 0; j < boxes.length(); j++) {
+                    res[j] += Math.abs(i - j);
+                }
+            }
+        }
+
+
+        return res;
+
+    }
+}

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

@@ -0,0 +1,22 @@
+package me.darksnakex.problems;
+
+
+public class p1929 {
+
+    public int[] getConcatenation(int[] nums) {
+
+
+        int[] res = new int[nums.length + nums.length];
+        int i = 0;
+        int j = 0;
+        while (j < nums.length + nums.length){
+            for (int num : nums) {
+                res[i] = num;
+                j++;
+                i++;
+            }
+
+    }
+        return res;
+    }
+}

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

@@ -0,0 +1,34 @@
+package me.darksnakex.problems;
+
+import java.util.Collections;
+import java.util.List;
+
+public class p2011 {
+
+
+    public int finalValueAfterOperations(String[] operations) {
+        int x = 0;
+        for (String operation : operations) {
+            if (operation.equals("X++") || operation.equals("++X")) {
+                x += 1;
+            } else {
+                x -= 1;
+            }
+
+        }
+
+        return x;
+
+    }
+
+    // Not that well lmao
+    public int finalValueAfterOperationsv2(String[] operations) {
+        List<String> list = List.of(operations);
+        return Collections.frequency(list,"X++") + Collections.frequency(list,"++X") - Collections.frequency(list,"X--") -Collections.frequency(list,"--X");
+
+    }
+
+
+
+}
+

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

@@ -0,0 +1,8 @@
+package me.darksnakex.problems;
+
+public class p2044 {
+
+
+
+
+}

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

@@ -0,0 +1,11 @@
+package me.darksnakex.problems;
+
+public class p2469 {
+
+    public double[] convertTemperature(double celsius) {
+
+        return new double[]{celsius+273.15,celsius*1.80 +32.00};
+
+    }
+
+}