Kenneth Fund. Drills1

.idea/.name

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

.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" 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

@@ -9,8 +9,12 @@ 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) {
+        boolean result = false;
+        if (value == input[0] || value == input[input.length - 1]) {
+            result = true;
+        }
+        return result;
     }
 
     /**
@@ -18,8 +22,13 @@ 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){
+    boolean x = false;
+    if (input.length >= 1 && input[0].equals(input[input.length-1])){
+        x = true;
+    }
+    boolean x2 = x;
+        return x2;
     }
 
 
@@ -30,7 +39,12 @@ public class ArrayDrills {
      *           commonEnd([1, 2, 3], [7, 3, 2]); // Should return false
      */
     public Boolean commonEnd(Integer[] input1, Integer[] input2){
-        return null;
+        boolean testing = false;
+        if (input1[0] == input2[0] || input1[input1.length-1].equals(input2[input2.length-1])){
+            testing = true;
+        }
+        Boolean testing2 = testing;
+        return testing2;
     }
 
     /**
@@ -39,7 +53,14 @@ public class ArrayDrills {
      *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
      */
     public Integer[] rotateLeft(Integer[] input){
-        return null;
+        Integer x = input[0];
+
+        for (Integer i = 0; i < input.length-1; i++){
+            input[i] = input[i + 1];
+        }
+
+        input[input.length - 1] = x;
+        return input;
     }
 
 
@@ -50,7 +71,21 @@ public class ArrayDrills {
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+        Integer[] x = new Integer[input.length];
+
+        for(Integer i = 0; i < input.length; i++){
+            Integer changing = 0;
+            if(input[i] > changing){
+                changing = i;
+            }
+            for(Integer q = 0; q < x.length; q++){
+                x[q] = changing;
+            }
+        }
+//        for(Integer q = 0; q > x.length; q++){
+//            x[q] = changing;
+//        }
+        return x;
     }
 
 
@@ -61,7 +96,23 @@ 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;
+        Integer[] x = new Integer[2];
+        if(input1.length % 2 != 0){
+            x[0] = input1[input1.length/2];
+        } else
+
+            if(input1.length % 2 == 0){
+            x[0] = (input1[input1.length/2]) + (input1[input1.length/2 - 1]);
+        }
+
+        if(input2.length % 2 != 0){
+            x[1] = input2[input2.length/2];
+        } else
+
+        if(input2.length % 2 == 0){
+            x[1] = (input2[input2.length/2]) + (input2[input2.length/2 - 1]);
+        }
+        return x;
     }
 
 
@@ -71,7 +122,12 @@ 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;
+        Integer q = a[0] + a[1];
+        Integer k = b[0] + b[1];
+        if (k > q){
+            return b;
+        }
+        return a;
     }
 
     /**
@@ -81,6 +137,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[] newArray = new Integer[3];
+        newArray[0] = nums[nums.length/2 - 1];
+        newArray[1] = nums[nums.length/2];
+        newArray[2] = nums[nums.length/2 + 1];
+        return newArray;
     }
 }

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