done drills

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

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

@@ -1,5 +1,7 @@
 package io.zipcoder;
 
+
+
 public class ArrayDrills {
 
 
@@ -10,7 +12,17 @@ public class ArrayDrills {
      *           firstLast(6, [1,2,3]); // Should return false
      */
     public Boolean firstLast(Integer value, Integer[] input){
-        return null;
+        boolean contain = false;
+
+        for(int i = 0; i < input.length; i++){
+            if(input[0].equals(value) || input[input.length - 1].equals(value)){
+                contain = true;
+            }
+
+        }
+
+
+        return contain;
     }
 
     /**
@@ -19,7 +31,21 @@ public class ArrayDrills {
      *           sameFirstLast([1,2,1]); // Should return true
      */
     public Boolean sameFirstLast(Integer[] input){
-        return null;
+        boolean contain = false;
+        for(int i = 0; i<input.length; i++){
+            if(input[0] == input[input.length-1]){
+                contain = true;
+
+            }
+            else{
+                contain = false;
+            }
+
+
+        }
+
+
+        return contain;
     }
 
 
@@ -30,7 +56,18 @@ public class ArrayDrills {
      *           commonEnd([1, 2, 3], [7, 3, 2]); // Should return false
      */
     public Boolean commonEnd(Integer[] input1, Integer[] input2){
-        return null;
+        boolean contain = false;
+
+        if(input1[0] == input2[0] || input1[input1.length-1] == input2[input2.length-1]){
+                contain = true;
+            }
+            else{
+                contain = false;
+            }
+
+
+
+        return contain;
     }
 
     /**
@@ -39,7 +76,19 @@ public class ArrayDrills {
      *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
      */
     public Integer[] rotateLeft(Integer[] input){
-        return null;
+        Integer[] newArr = new Integer[input.length];
+        int temp = input[0];
+
+        for(int i = 0; i<input.length-1; i++) {
+
+            newArr[i] = input[i + 1];
+
+
+        }
+
+        newArr[input.length-1] = temp;
+
+        return newArr;
     }
 
 
@@ -50,7 +99,26 @@ public class ArrayDrills {
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+
+        Integer[] output = new Integer[input.length];
+        int max = input[0];
+        for(int i = 0; i < input.length; i++){
+            if( input[i] > max ){
+                max = input[i];
+
+
+            }
+
+
+        }
+        for(int j = 0; j < output.length; j++){
+            output[j] = max;
+
+
+        }
+
+
+        return output;
     }
 
 
@@ -61,9 +129,28 @@ 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[] mid = new Integer[2];
+        mid[0] = middle(input1);
+        mid[1] = middle(input2);
+
+
+
+    return mid;
+
+
     }
+    private int middle(Integer[] input) {
+        int value = 0;
+        if (input.length % 2 == 0) {
 
+            value = input[input.length / 2] + input[(input.length / 2) - 1];
+        } else {
+            value =  input[input.length / 2];
+        }
+        return value;
+    }
 
     /**
      * Start with 2 int arrays, a and b, each length 2.
@@ -71,7 +158,30 @@ 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[] biggest = new Integer[a.length];
+        int suma = 0;
+        int sumb = 0;
+        for(Integer i : a){
+            suma += i;
+
+        }
+        for(Integer j : b){
+
+            sumb += j;
+        }
+        if (suma >= sumb){
+
+            biggest = a;
+
+        }
+        else{
+            biggest = b;
+        }
+
+
+
+        return biggest;
     }
 
     /**
@@ -81,6 +191,21 @@ public class ArrayDrills {
      *           midThree([8, 6, 7, 5, 3, 0, 9]); // Should return [7, 5, 3]
      */
     public Integer[] midThree(Integer[] nums){
-        return null;
+
+        Integer[] mid3 = new Integer[3];
+        int count = 0;
+        for(int i = 0; i < nums.length; i++){
+
+            if(i >= (nums.length/2)-1 && i <= (nums.length/2)+1){
+
+              mid3[count] = nums[i];
+
+              count ++;
+            }
+
+        }
+
+
+        return mid3;
     }
 }

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

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