done

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

@@ -1,5 +1,7 @@
 package io.zipcoder;
 
+import com.sun.media.sound.SoftMixingMixerProvider;
+
 public class ArrayDrills {
 
 
@@ -10,7 +12,12 @@ public class ArrayDrills {
      *           firstLast(6, [1,2,3]); // Should return false
      */
     public Boolean firstLast(Integer value, Integer[] input){
-        return null;
+        if(input[0]==value ||input[input.length-1]==value)
+        {
+            return true;
+        }
+
+        return false;
     }
 
     /**
@@ -19,7 +26,11 @@ public class ArrayDrills {
      *           sameFirstLast([1,2,1]); // Should return true
      */
     public Boolean sameFirstLast(Integer[] input){
-        return null;
+        if(input.length!=0&&input[0]==input[input.length-1])
+        {
+            return true;
+        }
+        return false;
     }
 
 
@@ -30,7 +41,11 @@ 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;
     }
 
     /**
@@ -39,7 +54,15 @@ public class ArrayDrills {
      *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
      */
     public Integer[] rotateLeft(Integer[] input){
-        return null;
+        Integer[] newArray=new Integer[input.length];
+
+
+        for(int i=0;i<input.length-1;i++)
+        {
+            newArray[i]=input[i+1];
+        }
+        newArray[input.length-1]=input[0];
+        return newArray;
     }
 
 
@@ -50,7 +73,20 @@ public class ArrayDrills {
      *           maxValue([5, 11, 9]); // Should return [11,11,11]
      */
     public Integer[] maxValue(Integer[] input){
-        return null;
+        int max=0;
+        Integer[] newArray =new Integer[input.length];
+        for (int i=0;i<input.length;i++)
+        {
+            if(input[i]>max)
+            {
+                max=input[i];
+            }
+        }
+        for (int i=0;i<input.length;i++)
+        {
+            newArray[i]=max;
+        }
+        return newArray;
     }
 
 
@@ -61,7 +97,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[] newArray=new Integer[2];
+        int len1=input1.length;
+        int len2=input2.length;
+        if(len1%2!=0)//odd input1
+        {
+            newArray[0]=input1[len1/2];
+
+
+        }
+        else//even input1
+        {
+            newArray[0]=input1[(len1-1)/2]+input1[len1/2];
+        }
+        if(len2%2!=0)//odd
+        {
+            newArray[1]=input2[len2/2];
+        }
+        else
+        {
+            newArray[1]=input2[(len2-1)/2]+input2[(len2/2)];
+        }
+        return newArray;
     }
 
 
@@ -71,7 +128,24 @@ 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 sum1=0;
+        int sum2=0;
+
+        for(int i=0;i<a.length;i++)
+        {
+            sum1=sum1+a[i];
+            sum2=sum2+b[i];
+        }
+        if(sum1==sum2)
+        {
+            return a;
+        }
+        else if(sum1>sum2)
+        {
+            return a;
+        }
+
+        return b;
     }
 
     /**
@@ -81,6 +155,19 @@ 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 len=nums.length;
+        int mid=len/2;
+
+
+            newArray[0]=nums[mid-1];
+            newArray[1]=nums[mid];
+            newArray[2]=nums[mid+1];
+
+
+
+
+        System.out.println(newArray);
+        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);
     }