done

.idea/.name

@@ -0,0 +1 @@
+FundamentalDrills-Part1

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

@@ -1,4 +1,5 @@
 package io.zipcoder;
+import java.util.*;
 
 public class ArrayDrills {
 
@@ -68,13 +69,12 @@ public class ArrayDrills {
      *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
      */
     public Integer[] rotateLeft(Integer[] input){
-        Integer[] arr = new Integer[input.length-1];
-        arr[0] = input[input.length-1];
-        for(int i=1;i<input.length;i++) {
-             arr[i] = input[i - 1];
+        Integer[] arr = new Integer[input.length];
+        for(int i=0;i<input.length;i++) {
+             arr[(i+(input.length-1))%input.length] = input[i];
 
             }
-      return null;
+      return arr;
     }
 
 
@@ -87,7 +87,23 @@ public class ArrayDrills {
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+        Integer [] arr = new Integer[input.length];
+        Integer element = null;
+        for(int i = 0; i < input.length;i++ ){
+            Integer tempElem = input[i];
+            for (int j =0; j<input.length; j++){
+                if (input[j] > tempElem){
+                    element = input[j];
+                }
+            }
+
+        }
+        for (int x = 0; x < arr.length;x++ ){
+            arr[x] = element;
+
+        }
+
+        return arr;
     }
 
 
@@ -98,7 +114,23 @@ 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 [] arr = new Integer[2];
+        int sum;
+        int sum1;
+        if (input1.length % 2 == 0){
+             sum =  input1[input1.length/2 -1] + input1[input1.length/2];
+        } else{
+             sum = input1[(input1.length+1)/2 -1];
+        }
+
+        if (input2.length % 2 == 0){
+            sum1 =  input2[input2.length/2 -1] + input2[input2.length/2];
+        } else{
+             sum1 = input2[(input2.length+1)/2 -1];
+        }
+        arr[0] = sum;
+        arr[1] = sum1;
+        return arr;
     }
 
 
@@ -108,7 +140,14 @@ public class ArrayDrills {
      * Return the array which has the largest sum. In event of a tie, return a.
      */
     public Integer[] biggerTwo(Integer[] a, Integer[] b){
-        return null;
+        int sum;
+        int sum1;
+        sum = a[0] + a[1];
+        sum1 = b[0] + b[1];
+        if (sum >= sum1){
+            return a;
+        }
+        return b;
     }
 
     /**
@@ -118,6 +157,21 @@ public class ArrayDrills {
      *           midThree([8, 6, 7, 5, 3, 0, 9]); // Should return [7, 5, 3]
      */
     public Integer[] midThree(Integer[] nums){
-        return null;
+        int n0;
+        int n1;
+        int n2;
+        Integer [] arr = new Integer[3];
+        if(nums.length == 3){
+            return nums;
+        }
+        else {
+            n0 = nums[(nums.length+1)/2 -2];
+            n1 = nums[ (nums.length+1)/2 -1];
+            n2 = nums[(nums.length+1)/2 ];
+            arr[0] = n0;
+            arr[1] = n1;
+            arr[2] = n2;
+        }
+        return arr;
     }
 }

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

@@ -179,7 +179,7 @@ public class ArrayDrillsTest {
     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);
     }