committing drill1

.gitignore

@@ -13,6 +13,8 @@
 .idea/**/sqlDataSources.xml
 .idea/**/dynamic.xml
 .idea/**/uiDesigner.xml
+.idea/**/misc.xml
+.idea/.name
 
 # Gradle:
 .idea/**/gradle.xml

.idea/compiler.xml

@@ -0,0 +1,13 @@
+<?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>
+  </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>

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

@@ -10,7 +10,15 @@ public class ArrayDrills {
      *           firstLast(6, [1,2,3]); // Should return false
      */
     public Boolean firstLast(Integer value, Integer[] input){
-        return null;
+        for(int i=0; i<input.length; i++){
+            if(value == input[i] || value == input[input.length-1]){
+              return true;
+            }
+
+
+        }
+
+        return false;
     }
 
     /**
@@ -19,8 +27,16 @@ public class ArrayDrills {
      *           sameFirstLast([1,2,1]); // Should return true
      */
     public Boolean sameFirstLast(Integer[] input){
-        return null;
-    }
+        for(int i=0; i<input.length; i++) {
+            if(input.length >= 1 && input[i] == input[input.length-1]) {
+                return true;
+            }
+        }
+        return false;
+
+        }
+
+
 
 
     /**
@@ -30,8 +46,13 @@ public class ArrayDrills {
      *           commonEnd([1, 2, 3], [7, 3, 2]); // Should return false
      */
     public Boolean commonEnd(Integer[] input1, Integer[] input2){
-        return null;
-    }
+        if(input1[0] == input2[0] || input1[input1.length-1] == input2[input2.length-1]){
+            return true;
+        }
+        return false;
+        }
+
+
 
     /**
      * Given an array of ints, return an array with the elements "rotated left" so {1, 2, 3} yields {2, 3, 1}.
@@ -39,8 +60,17 @@ 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];
+
+        for(int i=0; i<input.length-1; i++){
+          newArr[i] = input[i+1];
+        }
+        newArr[newArr.length-1] = input[0];
+        return newArr;
+        }
+
+
 
 
     /**
@@ -50,7 +80,26 @@ public class ArrayDrills {
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+        Integer[] newArr = new Integer[input.length];
+        int largestValue = input[0];
+        int k = 0;
+        for(int i=1; i<input.length; i++) {
+            if (input[i] > largestValue) {
+                largestValue = input[i];
+            }
+        }
+            for(int i=0; i<input.length; i++ ){
+                if(input[i] != largestValue){
+                    input[i] = largestValue;
+                    newArr[k] = input[i];
+                    k++;
+                }
+                else {
+                    newArr[k] = input[i];
+                    k++;
+                }
+            }
+        return newArr;
     }
 
 
@@ -61,7 +110,27 @@ 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[] newArr = new Integer[2];
+        int len1 = input1.length;
+        int len2 = input2.length;
+
+        if(len1%2 == 0){
+            newArr[0] = input1[len1/2] + input1[(len1-2)/2];
+
+        }
+        else {
+            newArr[0] = input1[len1/2];
+
+        }
+        if(len2%2 == 0){
+            newArr[1] = input2[len2/2] + input2[(len2-2)/2];
+
+        }
+        else {
+            newArr[1] = input2[len2/2];
+        }
+
+        return newArr;
     }
 
 
@@ -71,7 +140,18 @@ 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;
+
+        int total1 = a[0] + a[1];
+
+          int total2 = b[0] + b[1];
+
+          if(total1 >= total2)
+              return a;
+
+
+
+        return b;
+
     }
 
     /**
@@ -81,6 +161,15 @@ public class ArrayDrills {
      *           midThree([8, 6, 7, 5, 3, 0, 9]); // Should return [7, 5, 3]
      */
     public Integer[] midThree(Integer[] nums){
-        return null;
+
+        Integer[] newArr = new Integer[3];
+
+        int len = nums.length;
+
+        newArr[0] = nums[(len-2)/2];
+        newArr[1] = nums[len/2];
+        newArr[2] = nums[(len+1)/2];
+
+        return newArr;
     }
 }

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