Merge bdd1cfbca128650093dcb13cb58ac32cfea57614 into b2e20fd406b12d4908e4fb952d821a476dd96c45

.idea/compiler.xml

+<?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

+<?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_9" project-jdk-name="9.0" project-jdk-type="JavaSDK">
+    <output url="file://$PROJECT_DIR$/classes" />
+  </component>
+</project>

.idea/modules.xml

+<?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

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

FundamentalDrills-Part1.iml

+<?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

      * 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) {
 
+        if (value.equals(input[0]) || value.equals(input[input.length - 1])) return true;
+        return false;
+    }
     /**
      * Given an array of ints, return true if the array is length 1 or more, and the first element and the last element are equal.
      * 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) {
+        if (input.length > 1 && input[0] == input[input.length - 1]) return true;
+        return false;
     }
 
 
      *           commonEnd([1, 2, 3], [7, 3, 2]); // Should return false
      */
     public Boolean commonEnd(Integer[] input1, Integer[] input2){
-        return null;
+        if (input1[0].equals(input2[0]) || input1[input1.length-1].equals(input2[input2.length-1])) return true;
+        return false;
     }
 
     /**
      *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
      */
     public Integer[] rotateLeft(Integer[] input){
-        return null;
+        Integer[] newArray = new Integer[input.length];
+        for (int i = 0; i < input.length; i++) {
+            if (i == 0) newArray[2] = input[i];
+            else if  (i == 1) newArray[0] = input[i];
+            else if (i ==2) newArray[1] = input[i];
+        } return newArray;
     }
 
 
     /**
-     * Given an array of ints, figure out which is element in the array is largest,
+     * Given an array of ints, figure out which element in the array is largest,
      * and set all the other elements to be that value. Return the changed array.
      * example : maxValue([1, 2, 3]); // Should return [3,3,3]
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+
+        Integer[] maxValueArray = new Integer[input.length];
+        int currentMaxValue = 0;
+        int currentValue;
+
+        for(int i =0; i < input.length; i++ ) {
+           currentValue = input[i];
+            if (currentValue > currentMaxValue) {
+                currentMaxValue = currentValue;
+            }
+        }
+
+        for (int j =0; j < input.length; j++) {
+            maxValueArray[j] = currentMaxValue;
+        }
+
+        return maxValueArray;
     }
 
 
      *           middleWay([5, 1, 2, 9], [3, 4, 5, 5]); // Should return [3, 9]
      */
     public Integer[] middleWay(Integer[] input1, Integer[] input2){
-        return null;
+        Integer[] newArray = new Integer[2];
+
+        newArray[0] = middleWayHelp(input1);
+        newArray[1] = middleWayHelp(input2);
+        return newArray;
+    }
+    public Integer middleWayHelp (Integer[] input) {
+
+        int middleElements;
+        if (input.length % 2 == 0)
+            middleElements = input[(Math.round(input.length/2))] + (input[(Math.round(input.length/2) -1)]);
+        else middleElements = input[Math.round(input.length/2)];
+
+        return middleElements;
+
     }
 
 
      * 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 sumOfA = a[0] +a[1];
+        int sumOfB = b[0] + b[1];
+
+        if (sumOfA >= sumOfB) return a;
+        else return b;
+
     }
 
     /**
      *           midThree([8, 6, 7, 5, 3, 0, 9]); // Should return [7, 5, 3]
      */
     public Integer[] midThree(Integer[] nums){
-        return null;
+        int length = nums.length;
+        Integer[] newArray = {nums[(length/2 -1)], nums[length/2], nums[(length/2 +1)]};
+        return newArray;
     }
 }

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

 package io.zipcoder;
 
-import com.sun.tools.corba.se.idl.InterfaceGen;
 import org.junit.Assert;
 import org.junit.Before;
 import org.junit.Test;
     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);
     }