Merge dc1c87d175ea3d5bba1731ac4111bd51f92968d5 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_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,8 @@
 package io.zipcoder;
 
+import java.util.ArrayList;
+import java.util.Arrays;
+
 public class ArrayDrills {
 
 
@@ -10,7 +13,7 @@ public class ArrayDrills {
      *           firstLast(6, [1,2,3]); // Should return false
      */
     public Boolean firstLast(Integer value, Integer[] input){
-        return null;
+        return (value.equals(input[0])||value.equals(input[input.length-1]));
     }
 
     /**
@@ -19,7 +22,7 @@ public class ArrayDrills {
      *           sameFirstLast([1,2,1]); // Should return true
      */
     public Boolean sameFirstLast(Integer[] input){
-        return null;
+        return (input[0].equals(input[input.length-1]));
     }
 
 
@@ -30,7 +33,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].equals(input2[0]) || input1[input1.length-1].equals(input2[input2.length-1]));
     }
 
     /**
@@ -38,8 +41,15 @@ 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 [] rotateLeft = new Integer[input.length];
+        rotateLeft[rotateLeft.length - 1] = input[0];
+
+        for (Integer i = 0; i < rotateLeft.length - 1; i++) {
+            rotateLeft[i] = input[i + 1];
+        }
+        return rotateLeft;
     }
 
 
@@ -50,7 +60,14 @@ public class ArrayDrills {
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+        Arrays.sort(input);
+        ArrayList<Integer> newArray = new ArrayList<Integer>();
+        for(int i =0; i < input.length; i++){
+           newArray.add(input[input.length-1]);
+        }
+        Integer[] result= newArray.toArray(new Integer[newArray.size()]);
+
+        return result;
     }
 
 
@@ -60,27 +77,55 @@ 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[] newArray = new Integer[2];
+
+        newArray[0] = middleOfArray(input1);
+        newArray[1] =  middleOfArray(input2);
+
+        return  newArray;
     }
 
+    public int middleOfArray(Integer[] input){
+        if((input.length % 2 == 0)){
+            return (input[input.length / 2] + input[(input.length / 2)-1]);
+        }
+        else if((input.length % 2 != 0)){
+            return input[input.length / 2];
+        }
+
+        return 0;
+    }
 
     /**
      * 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;
+    public Integer[] biggerTwo(Integer[] a, Integer[] b) {
+        int arrayOne = a[0] + a[1];
+        int arrayTwo = b[0] + b[1];
+
+        if (arrayOne == arrayTwo) {
+            return a;
+        } else if (arrayOne > arrayTwo) {
+            return a;
+        } else
+            return b;
     }
 
+
     /**
      * Given an array of ints of odd length, return a new array length 3 containing the elements from the middle of the array.
      * The array length will be at least 3.
      * example : midThree([1, 2, 3, 4, 5]); // Should return [2, 3, 4]
      *           midThree([8, 6, 7, 5, 3, 0, 9]); // Should return [7, 5, 3]
      */
-    public Integer[] midThree(Integer[] nums){
-        return null;
-    }
+    public Integer[] midThree(Integer[] nums) {
+        Integer n = nums.length / 2;
+        Integer[] middleThree = {nums[n - 1], nums[n], nums[n + 1]};
+        return middleThree;
+        }
 }
+

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