Merge 33c1a242b71508b325a9c0ff1c4f91cf4557ae05 into b2e20fd406b12d4908e4fb952d821a476dd96c45

.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_9" project-jdk-name="9.0" 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

@@ -10,7 +10,7 @@ public class ArrayDrills {
      *           firstLast(6, [1,2,3]); // Should return false
      */
     public Boolean firstLast(Integer value, Integer[] input){
-        return null;
+        return (input[0] == value || input[input.length-1] == value);
     }
 
     /**
@@ -19,10 +19,9 @@ public class ArrayDrills {
      *           sameFirstLast([1,2,1]); // Should return true
      */
     public Boolean sameFirstLast(Integer[] input){
-        return null;
+    return (input.length >= 1 && input[0] == input[input.length-1]);
     }
 
-
     /**
      * Given 2 arrays of ints, a and b, return true if they have the same first element or they have the same last element.
      * Both arrays will be length 1 or more.
@@ -30,7 +29,7 @@ public class ArrayDrills {
      *           commonEnd([1, 2, 3], [7, 3, 2]); // Should return false
      */
     public Boolean commonEnd(Integer[] input1, Integer[] input2){
-        return null;
+        return (input1[0] == input2[0] || input1[input1.length-1] == input2[input2.length-1]);
     }
 
     /**
@@ -38,8 +37,10 @@ public class ArrayDrills {
      * example : rotateLeft([1, 2, 3]); // Should return [2,3,1]
      *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
      */
-    public Integer[] rotateLeft(Integer[] input){
-        return null;
+    public Integer[] rotateLeft(Integer[] input) {
+
+       Integer[] rotating = {input[1], input[2], input[0]};
+        return rotating;
     }
 
 
@@ -50,8 +51,18 @@ public class ArrayDrills {
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+    Integer maxValue = input[0];
+    for(Integer i = 0; i< input.length; i++) {
+        if (input[i] > maxValue) {
+            maxValue = input[i];
+        }
+    }
+    Integer[]outPut = new Integer[input.length];
+    for(int j=0; j<input.length; j++) {
+        outPut[j]=maxValue;
     }
+    return outPut;
+}
 
 
     /**
@@ -60,18 +71,33 @@ 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[] newInput = new Integer[2];
+        if(input1.length % 2 == 0) {
+            newInput[0] = (input1.length / 2) + (input1.length / 2-1);
+        } else if (input1.length % 2 != 0){
+            newInput[0] = input1[input1.length / 2];
+        }
+        if (input2.length % 2 == 0) {
+            newInput[1] = ((input2[input2.length / 2]) + (input2[input2.length / 2 - 1]));
+        }
+        else if (input2.length % 2 != 0) {
+            newInput[1] = input2[input2.length / 2];
+        }
+        return newInput;
     }
 
-
     /**
      * 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;
+        int sumA = a[0] + a[1];
+        int sumB =  b[0] + b[1];
+        if (sumA > sumB)
+            return a;
+            return b;
     }
 
     /**
@@ -81,6 +107,12 @@ 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];
+        Integer 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

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