Lab finished

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

@@ -10,7 +10,11 @@ public class ArrayDrills {
      *           firstLast(6, [1,2,3]); // Should return false
      */
     public Boolean firstLast(Integer value, Integer[] input){
-        return null;
+        boolean isTrue = false;
+        if (input[0] == value || input[input.length-1] == value) {
+            isTrue = true;
+        }
+        return isTrue;
     }
 
     /**
@@ -19,7 +23,11 @@ public class ArrayDrills {
      *           sameFirstLast([1,2,1]); // Should return true
      */
     public Boolean sameFirstLast(Integer[] input){
-        return null;
+        boolean isTrue = false;
+        if (input.length >= 1 && input[0] == input[input.length-1]) {
+            isTrue = true;
+        }
+        return isTrue;
     }
 
 
@@ -30,7 +38,11 @@ public class ArrayDrills {
      *           commonEnd([1, 2, 3], [7, 3, 2]); // Should return false
      */
     public Boolean commonEnd(Integer[] input1, Integer[] input2){
-        return null;
+        boolean isTrue = false;
+        if (input1[0] == input2[0] || input1[input1.length-1] == input2[input2.length-1]) {
+            isTrue = true;
+        }
+        return isTrue;
     }
 
     /**
@@ -39,7 +51,12 @@ public class ArrayDrills {
      *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
      */
     public Integer[] rotateLeft(Integer[] input){
-        return null;
+        Integer[] rotatedLeftArray = new Integer[input.length];
+        for (int i=1; i<input.length; i++) {
+            rotatedLeftArray[i-1] = input[i];
+        }
+        rotatedLeftArray[input.length-1] = input[0];
+        return rotatedLeftArray;
     }
 
 
@@ -50,7 +67,17 @@ public class ArrayDrills {
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+        Integer[] changedArray = new Integer[input.length];
+        int largestElement = input[0];
+        for (int i=1; i<input.length; i++) {
+            if (input[i] > largestElement) {
+                largestElement = input[i];
+            }
+        }
+        for (int i=0; i<input.length; i++) {
+            changedArray[i] = largestElement;
+        }
+        return changedArray;
     }
 
 
@@ -61,7 +88,20 @@ 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[] middleWayArray = new Integer[2];
+        middleWayArray[0] = checkArrayLength(input1);
+        middleWayArray[1] = checkArrayLength(input2);
+        return middleWayArray;
+    }
+
+    public Integer checkArrayLength (Integer[] input) {
+        Integer returnedValue;
+        if (input.length%2 == 1) {
+            returnedValue = input[input.length/2];
+        } else {
+            returnedValue = input[input.length/2] + input[input.length/2-1];
+        }
+        return returnedValue;
     }
 
 
@@ -71,7 +111,13 @@ 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;
+        Integer[] returnedArray;
+        if (a[0] + a[1] >= b[0] + b[1]) {
+            returnedArray = a;
+        } else {
+            returnedArray = b;
+        }
+        return returnedArray;
     }
 
     /**
@@ -81,6 +127,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[] midThreeArray = new Integer[3];
+        midThreeArray[0] = nums[nums.length/2-1];
+        midThreeArray[1] = nums[nums.length/2];
+        midThreeArray[2] = nums[nums.length/2+1];
+        return midThreeArray;
     }
 }

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);
     }