done

src/main/java/io/zipcoder/ArrayDrills.java

@@ -1,5 +1,7 @@
 package io.zipcoder;
 
+import java.util.Arrays;
+
 public class ArrayDrills {
 
 
@@ -64,7 +66,12 @@ public class ArrayDrills {
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+        Arrays.sort(input);
+        int max = input[input.length-1];
+        for (int j = 0; j < input.length-1; j++){
+            input[j] = max;
+        }
+        return input;
     }
 
 
@@ -75,17 +82,43 @@ public class ArrayDrills {
      *           middleWay([5, 1, 2, 9], [3, 4, 5, 5]); // Should return [3, 9]
      */
     public Integer[] middleWay(Integer[] input1, Integer[] input2){
-        return null;
+        Integer[] newArr = new Integer[2];
+        newArr[0] = findMiddleReturnSum(input1);
+        newArr[1] = findMiddleReturnSum(input2);
+        return newArr;
+    }
+
+    public Integer findMiddleReturnSum(Integer[] array){
+        Integer ans = 0;
+        if (array.length % 2 == 0){
+            ans += array[array.length/2] + array[(array.length/2)-1];
+        } else {
+            ans = array[array.length/2];
+        }
+        return ans;
     }
 
 
+
     /**
      * Start with 2 int arrays, a and b, each length 2.
      * Consider the sum of the values in each array.
      * Return the array which has the largest sum. In event of a tie, return a.
      */
     public Integer[] biggerTwo(Integer[] a, Integer[] b){
-        return null;
+        if (arraySum(a) > arraySum(b)){
+            return a;
+        } else if (arraySum(a) <  arraySum(b)){
+            return b;
+        } else { return a; }
+    }
+
+    public int arraySum(Integer[] arr){
+        int sum1 = 0;
+        for (Integer element: arr){
+            sum1 += element;
+        }
+        return sum1;
     }
 
     /**
@@ -95,6 +128,10 @@ public class ArrayDrills {
      *           midThree([8, 6, 7, 5, 3, 0, 9]); // Should return [7, 5, 3]
      */
     public Integer[] midThree(Integer[] nums){
-        return null;
+        Integer[] newArr = new Integer[3];
+        newArr[0] = nums[(nums.length/2) - 1];
+        newArr[1] = nums[nums.length/2];
+        newArr[2] = nums[(nums.length/2) + 1];
+        return newArr;
     }
 }