and then there was one...

.idea/compiler.xml

@@ -0,0 +1,16 @@
+<?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>
+    <bytecodeTargetLevel>
+      <module name="FundamentalDrills-Part1" target="1.5" />
+    </bytecodeTargetLevel>
+  </component>
+</project>

.idea/misc.xml

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <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$/classes" />
+  </component>
+</project>

.idea/modules.xml

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/FundamentalDrills-Part1.iml" filepath="$PROJECT_DIR$/FundamentalDrills-Part1.iml" />
+    </modules>
+  </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>

FundamentalDrills-Part1.iml

@@ -0,0 +1,16 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module org.jetbrains.idea.maven.project.MavenProjectsManager.isMavenModule="true" type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" LANGUAGE_LEVEL="JDK_1_5">
+    <output url="file://$MODULE_DIR$/target/classes" />
+    <output-test url="file://$MODULE_DIR$/target/test-classes" />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src/main/java" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/src/test/java" isTestSource="true" />
+      <excludeFolder url="file://$MODULE_DIR$/target" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="library" scope="TEST" name="Maven: junit:junit:4.12" level="project" />
+    <orderEntry type="library" scope="TEST" name="Maven: org.hamcrest:hamcrest-core:1.3" level="project" />
+  </component>
+</module>

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

@@ -1,5 +1,9 @@
 package io.zipcoder;
 
+import jdk.internal.util.xml.impl.Input;
+import java.util.Collections;
+import java.util.Arrays;
+
 public class ArrayDrills {
 
 
@@ -9,8 +13,16 @@ public class ArrayDrills {
      * example : firstLast(6, [1,2,6); // Should return true
      *           firstLast(6, [1,2,3]); // Should return false
      */
-    public Boolean firstLast(Integer value, Integer[] input){
-        return null;
+    public Boolean firstLast(Integer value, Integer[] input) {
+        int firstElement = input[0];
+        int lastLastElement = input[input.length - 1];
+        if (firstElement == value || lastLastElement == value) {
+            return true;
+        }
+        // get first element
+        // get last element
+        // check if first Element or last element = value
+        return false;
     }
 
     /**
@@ -18,10 +30,15 @@ public class ArrayDrills {
      * example : sameFirstLast([1,2,3]); // Should return false
      *           sameFirstLast([1,2,1]); // Should return true
      */
-    public Boolean sameFirstLast(Integer[] input){
-        return null;
-    }
+    public Boolean sameFirstLast(Integer[] input) {
+        int firstElement = input[0];
+        int lastElement = input[input.length - 1];
+        if (lastElement == firstElement) {
+            return true;
+        }
 
+        return false;
+    }
 
     /**
      * Given 2 arrays of ints, a and b, return true if they have the same first element or they have the same last element.
@@ -29,8 +46,16 @@ public class ArrayDrills {
      * example : commonEnd([1, 2, 3], [7, 3]); // Should return true
      *           commonEnd([1, 2, 3], [7, 3, 2]); // Should return false
      */
-    public Boolean commonEnd(Integer[] input1, Integer[] input2){
-        return null;
+    public Boolean commonEnd(Integer[] input1, Integer[] input2) {
+        Integer firstArrayElement = input1[0];
+        Integer firstArrayLastElement = input1[input1.length - 1];
+        Integer secondArrayElement = input2[0];
+        Integer secondArrayLastElement = input2[input2.length - 1];
+        if (firstArrayElement.equals(secondArrayElement) || firstArrayLastElement.equals(secondArrayLastElement)) {
+            return true;
+        }
+
+        return false;
     }
 
     /**
@@ -39,7 +64,9 @@ public class ArrayDrills {
      *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
      */
     public Integer[] rotateLeft(Integer[] input){
-        return null;
+        Collections.rotate(Arrays.asList(input), 2);
+        System.out.println(Arrays.toString(input));
+        return input;
     }
 
 
@@ -50,7 +77,12 @@ public class ArrayDrills {
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+        int max = Collections.max(Arrays.asList(input));
+        for(int i = 0; i < input.length; i++) {
+            input[i] = max;
+        }
+
+        return input;
     }
 
 
@@ -61,17 +93,40 @@ 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;
+        //assign new arrays
+        Integer[] midWay = new Integer[2];
+        midWay[0] = findMid(input1);
+        midWay[1] = findMid(input2);
+        return midWay;
     }
 
+    //made an assisting method that will find the middle index for...too much looping involved and I got lazy
+
+    public int findMid(Integer[] newInput) {
+        if (newInput.length % 2 == 0) {
+            return newInput[newInput.length/2] + newInput[newInput.length/2 - 1];
+        }
 
+        return newInput[newInput.length/2];
+    }
     /**
      * 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;
+        Integer sumA = 0;
+        Integer sumB = 0;
+        for(int i = 0; i < a.length; i++){
+            sumA += a[i];
+            sumB += b[i];
+        }
+
+        if (sumA == sumB){
+            return a;
+        }
+//this does not pass the 3rd test case for this...should make another an assisting method tio
+        return b;
     }
 
     /**
@@ -81,6 +136,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 [] resultArr = new Integer[3];
+        resultArr[0] = nums[(nums.length/2) - 1];
+        resultArr[1] = nums[(nums.length/2)];
+        resultArr[2] = nums[(nums.length/2) + 1];
+        return resultArr;
     }
 }