Added 2 solutions

varunu28 · varunu28 · commit 4c22a975bcca · 2017-12-07T12:38:32.000-08:00
diff --git a/Medium/Minimum Moves to Equal Array Elements II.java b/Medium/Minimum Moves to Equal Array Elements II.java
@@ -0,0 +1,17 @@
+class Solution {
+    public int minMoves2(int[] nums) {
+        int i = 0;
+        int j = nums.length-1;
+        int c = 0;
+        
+        Arrays.sort(nums);
+        
+        while (i < j) {
+            c += nums[j] - nums[i];
+            i++;
+            j--;
+        }
+        
+        return c;
+    }
+}
diff --git a/Medium/Optimal Division.java b/Medium/Optimal Division.java
@@ -0,0 +1,18 @@
+class Solution {
+    public String optimalDivision(int[] nums) {
+        StringBuilder sb = new StringBuilder("");
+        
+        sb.append(nums[0]);
+        
+        for(int i=1;i<nums.length;i++) {
+            if (i == 1 && nums.length > 2) {
+                sb.append("/(").append(nums[i]);
+            }
+            else {
+                sb.append("/").append(nums[i]);
+            }
+        }
+        
+        return nums.length > 2 ? sb.append(")").toString() : sb.toString();
+    }
+}
