.idea/.name

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

.idea/compiler.xml

@@ -0,0 +1,14 @@
+<?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 target="8" />
+  </component>
+</project>

.idea/misc.xml

@@ -0,0 +1,14 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ExternalStorageConfigurationManager" enabled="true" />
+  <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$/out" />
+  </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,7 @@ public class ArrayDrills {
      *           firstLast(6, [1,2,3]); // Should return false
      */
     public Boolean firstLast(Integer value, Integer[] input){
-        return null;
+        return input[0] == value || input[input.length - 1] == value;
     }
 
     /**
@@ -19,7 +19,7 @@ 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 +30,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] == input2[0] || input1[input1.length - 1] == input2[input2.length - 1];
     }
 
     /**
@@ -39,7 +39,7 @@ public class ArrayDrills {
      *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
      */
     public Integer[] rotateLeft(Integer[] input){
-        return null;
+        return new Integer[] {input[1], input[2], input[0]};
     }
 
 
@@ -50,7 +50,14 @@ public class ArrayDrills {
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+        int max = Integer.MIN_VALUE;
+        for (Integer e : input) {
+            max = Math.max(max, e);
+        }
+        for (int i = 0; i < input.length; i++) {
+            input[i] = max;
+        }
+        return input;
     }
 
 
@@ -60,8 +67,16 @@ 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 boolean isEvenArray(Integer[] input) {
+        return input.length % 2 == 0;
+    }
     public Integer[] middleWay(Integer[] input1, Integer[] input2){
-        return null;
+        int i1 = input1.length / 2;
+        int i2 = input2.length / 2;
+        return new Integer[] {
+                isEvenArray(input1) ? input1[i1] + input1[i1 - 1] : input1[i1],
+                isEvenArray(input2) ? input2[i2] + input2[i2 - 1] : input2[i2]
+        };
     }
 
 
@@ -71,7 +86,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;
+        int sumA = 0;
+        int sumB = 0;
+        for (int i = 0; i < 2; i++) {
+            sumA += a[i];
+            sumB += b[i];
+        }
+        return sumA >= sumB ? a : b;
     }
 
     /**
@@ -80,7 +101,11 @@ public class ArrayDrills {
      * 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) {
+        return new Integer[] {
+                nums[nums.length / 2 - 1],
+                nums[nums.length / 2],
+                nums[nums.length / 2 + 1]
+        };
     }
 }

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