done drillys

.idea/.name

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

.idea/compiler.xml

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="CompilerConfiguration">
+    <annotationProcessing>
+      <profile name="Maven default annotation processors profile" enabled="true">
+        <sourceOutputDir name="target/generated-sources/annotations" />
+        <sourceTestOutputDir name="target/generated-test-sources/test-annotations" />
+        <outputRelativeToContentRoot value="true" />
+        <module name="FundamentalDrills-Part1" />
+      </profile>
+    </annotationProcessing>
+  </component>
+</project>

.idea/misc.xml

@@ -0,0 +1,14 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ExternalStorageConfigurationManager" enabled="true" />
+  <component name="MavenProjectsManager">
+    <option name="originalFiles">
+      <list>
+        <option value="$PROJECT_DIR$/pom.xml" />
+      </list>
+    </option>
+  </component>
+  <component name="ProjectRootManager" version="2" languageLevel="JDK_1_8" project-jdk-name="1.8" project-jdk-type="JavaSDK">
+    <output url="file://$PROJECT_DIR$/out" />
+  </component>
+</project>

.idea/vcs.xml

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="$PROJECT_DIR$" vcs="Git" />
+  </component>
+</project>

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

@@ -1,5 +1,10 @@
 package io.zipcoder;
 
+import java.util.List;
+
+import static java.util.Arrays.*;
+import static java.util.Collections.*;
+
 public class ArrayDrills {
 
 
@@ -10,7 +15,20 @@ public class ArrayDrills {
      *           firstLast(6, [1,2,3]); // Should return false
      */
     public Boolean firstLast(Integer value, Integer[] input){
-        return null;
+       boolean answer = false;
+
+       for(int i = 0; i < input.length; i++) {
+           if (input[0] == value) {
+               answer = true;
+
+           } else if (input[input.length - 1] == value) {
+               answer = true;
+           }
+
+       }
+
+
+        return answer;
     }
 
     /**
@@ -19,7 +37,9 @@ public class ArrayDrills {
      *           sameFirstLast([1,2,1]); // Should return true
      */
     public Boolean sameFirstLast(Integer[] input){
-        return null;
+        return input.length > 0 && input[0] == input[input.length -1] ? true : false;
+
+
     }
 
 
@@ -30,7 +50,22 @@ public class ArrayDrills {
      *           commonEnd([1, 2, 3], [7, 3, 2]); // Should return false
      */
     public Boolean commonEnd(Integer[] input1, Integer[] input2){
-        return null;
+          boolean common = false;
+
+        if (input1[0] == input2[0]) {
+            common = true;
+
+        }
+        if (input1[input1.length-1] == input2[input2.length-1]) {
+
+           common = true;
+        }
+
+        //return input1[input1.length-1] == input2[input2.length-1] ||  input1[0] == input2[0];
+
+
+        return common;
+
     }
 
     /**
@@ -39,7 +74,15 @@ public class ArrayDrills {
      *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
      */
     public Integer[] rotateLeft(Integer[] input){
-        return null;
+
+        List<Integer> arrayList = asList(input);
+
+        rotate(arrayList, -1);
+
+        Integer[] arr = arrayList.toArray(new Integer[arrayList.size()]);
+
+
+        return arr;
     }
 
 
@@ -50,7 +93,23 @@ public class ArrayDrills {
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+        List<Integer> arrayList = asList(input);
+
+
+        fill(arrayList, max(arrayList));
+
+        Integer[] arr = arrayList.toArray(new Integer[arrayList.size()]);
+
+
+
+
+
+
+
+
+
+
+        return arr;
     }
 
 
@@ -60,8 +119,27 @@ public class ArrayDrills {
      * example : middleWay([1, 2, 3], [4,5,6,2]); // Should return [2,11]
      *           middleWay([5, 1, 2, 9], [3, 4, 5, 5]); // Should return [3, 9]
      */
-    public Integer[] middleWay(Integer[] input1, Integer[] input2){
-        return null;
+    public Integer[] middleWay(Integer[] input1, Integer[] input2) {
+
+        Integer[] array = new Integer[2];
+
+        if (input1.length % 2 != 0) {
+
+            array[0] = input1[input1.length / 2];
+        } else if (input1.length % 2 == 0) {
+            array[0] = input1[input1.length / 2] + input1[input1.length / 2 - 1];
+
+        }
+        if (input2.length % 2 != 0) {
+
+            array[1] = input2[input2.length / 2];
+        } else if (input2.length % 2 == 0) {
+            array[1] = input2[input2.length / 2] + input2[input2.length / 2 - 1];
+
+
+
+        }
+        return array;
     }
 
 
@@ -71,7 +149,15 @@ 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;
+        if (a[0] + a[1] > b[0] + b[1]){
+            return a;
+        }
+            return b;
+
+
+
+
+
     }
 
     /**
@@ -81,6 +167,19 @@ public class ArrayDrills {
      *           midThree([8, 6, 7, 5, 3, 0, 9]); // Should return [7, 5, 3]
      */
     public Integer[] midThree(Integer[] nums){
-        return null;
+        Integer[] halfArray = new Integer[3];
+        int half = nums.length/2;
+        halfArray[0] = nums[half-1];
+        halfArray[1] = nums[half];
+        halfArray[2] = nums[half+1];
+
+
+
+
+
+
+
+
+        return halfArray;
     }
 }

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

@@ -177,7 +177,7 @@ public class ArrayDrillsTest {
 
     @Test
     public void biggerTwo3(){
-        Integer[] inputArray1 = {-1 ,20};
+        Integer[] inputArray1 = {1 ,20};
         Integer[] inputArray2 = {2, 15};
         Integer[] expected = {1,20};
         Integer[] actual = arrayDrills.biggerTwo(inputArray1, inputArray2);