lab

.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" languageLevel="JDK_10" project-jdk-name="10" 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>

README.md

@@ -1 +1 @@
-# FundamentalDrills-Part1
+  # FundamentalDrills-Part1

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

@@ -1,4 +1,7 @@
 package io.zipcoder;
+import java.util.*;
+
+import static java.util.Collections.fill;
 
 public class ArrayDrills {
 
@@ -10,7 +13,16 @@ public class ArrayDrills {
      *           firstLast(6, [1,2,3]); // Should return false
      */
     public Boolean firstLast(Integer value, Integer[] input){
-        return null;
+        Boolean firstLast = false;
+        for (int i = 0; i < input.length; i++) {
+            if(input[0] == value) {
+                firstLast = true;
+            } else if(input[input.length -1] == value)  {
+                firstLast = true;
+            }
+        }
+
+        return firstLast;
     }
 
     /**
@@ -19,7 +31,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];
     }
 
 
@@ -30,7 +44,14 @@ public class ArrayDrills {
      *           commonEnd([1, 2, 3], [7, 3, 2]); // Should return false
      */
     public Boolean commonEnd(Integer[] input1, Integer[] input2){
-        return null;
+        boolean common = false;
+        if(input1[0] == input2[0]) {
+            common = true;
+        }
+        if(input1[input1.length-1] == input2[input2.length-1]){
+            common = true;
+        }
+        return common;
     }
 
     /**
@@ -39,7 +60,16 @@ public class ArrayDrills {
      *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
      */
     public Integer[] rotateLeft(Integer[] input){
-        return null;
+
+        List<Integer> integerList = Arrays.asList(input);
+
+        Collections.rotate(integerList, -1);
+
+        Integer[] newArray = integerList.toArray(new Integer[integerList.size()]);
+
+        return newArray;
+
+
     }
 
 
@@ -50,7 +80,15 @@ public class ArrayDrills {
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+
+        List<Integer> integerList = Arrays.asList(input);
+
+        fill(integerList, Collections.max(integerList));
+
+        Integer[] newArray = integerList.toArray(new Integer[integerList.size()]);
+
+        return newArray;
+
     }
 
 
@@ -61,7 +99,24 @@ 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[] newArray = new Integer[2];
+        if(input1.length % 2 == 1) {
+            Integer middle = input1.length / 2;
+            newArray[0] = input1[middle];
+        }
+        if(input1.length % 2 == 0) {
+            Integer add = input1.length / 2;
+            newArray[0] = input1[add-1] + input1[add];
+        }
+        if(input2.length % 2 == 1) {
+            Integer mid = input2.length / 2;
+            newArray[1] = input2[mid];
+        }
+        if(input2.length % 2 == 0) {
+            Integer add = input2.length / 2;
+            newArray[1] = input2[add-1] + input2[add];
+        }
+        return newArray;
     }
 
 
@@ -71,7 +126,13 @@ 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;
+
+        if(a[0] + a[1] > b[0] + b[1]) {
+            return a;
+        } else {
+            return b;
+        }
+
     }
 
     /**
@@ -81,6 +142,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[] newArray = new Integer[3];
+        int halfway = nums.length/2;
+        newArray[0] = nums[halfway -1];
+        newArray[1] = nums[halfway];
+        newArray[2] = nums[halfway +1];
+
+        return newArray;
     }
 }

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

@@ -1,6 +1,5 @@
 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 +176,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);