Mid

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

      *           middleWay([5, 1, 2, 9], [3, 4, 5, 5]); // Should return [3, 9]
      */
     public Integer[] middleWay(Integer[] input1, Integer[] input2){
+        Integer [] myArray = new Integer[2];
 
-        Integer newArr [] = {};
+        if (input1.length % 2 != 0 && input2.length % 2 != 0){
 
-        if(newArr.length % 2 == 0){
 
-        } else{
+        } else if(input1.length % 2 == 0 && input2.length % 2 == 0){
 
         }
         return null;
      * Return the array which has the largest sum. In event of a tie, return a.
      */
     public Integer[] biggerTwo(Integer[] a, Integer[] b){
-
-        int Sum = a[0] + a[1] -b[0]-b[1];
-        if (Sum >= 0){
-            return a;
-
+        if (a[0] + a[1] < b[0] + b[1]){
+            return b;
         }
-        return b;
+        return a;
     }
 
     /**
      */
     public Integer[] midThree(Integer[] nums){
 
-        if(nums.length % 2 == 0){
+        Integer [] myArray = new Integer[3];
 
-        }
+        Integer middle = nums.length/2;
 
-        return null;
+        myArray[0] = nums[middle-1];
+        myArray[1] =  nums[middle];
+        myArray[2] = nums[middle+1];
+
+
+     return myArray;
     }
 }

src/test/java/io/zipcoder/ArrayDrillsTest.java

     public void biggerTwo3(){
         Integer[] inputArray1 = {-1 ,20};
         Integer[] inputArray2 = {2, 15};
-        Integer[] expected = {1,20};
+        Integer[] expected = {-1,20};
         Integer[] actual = arrayDrills.biggerTwo(inputArray1, inputArray2);
         Assert.assertArrayEquals(expected, actual);
     }