First try...

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

@@ -1,4 +1,7 @@
 package io.zipcoder;
+import java.util.Arrays;
+import java.util.ArrayUtils;
+
 
 public class ArrayDrills {
 
@@ -9,8 +12,14 @@ public class ArrayDrills {
      * example : firstLast(6, [1,2,6); // Should return true
      *           firstLast(6, [1,2,3]); // Should return false
      */
-    public Boolean firstLast(Integer value, Integer[] input){
-        return null;
+    public boolean firstLast(Integer value, Integer[] input){   //change b to B
+        boolean firstLast = false;
+        //for (int i = 0; i<input.length; i++){
+            if(value = intput[0] || value = input[input.length-1]){
+                firstLast = true;
+        }
+
+        return firstLast;
     }
 
     /**
@@ -18,8 +27,12 @@ public class ArrayDrills {
      * example : sameFirstLast([1,2,3]); // Should return false
      *           sameFirstLast([1,2,1]); // Should return true
      */
-    public Boolean sameFirstLast(Integer[] input){
-        return null;
+    public boolean sameFirstLast(Integer[] input){  //change b to B
+        boolean same = false;
+        if (input.length >= 2 && input[0] == input[input.length-1]){
+            same = true;
+        }
+        return same;
     }
 
 
@@ -29,8 +42,12 @@ public class ArrayDrills {
      * example : commonEnd([1, 2, 3], [7, 3]); // Should return true
      *           commonEnd([1, 2, 3], [7, 3, 2]); // Should return false
      */
-    public Boolean commonEnd(Integer[] input1, Integer[] input2){
-        return null;
+    public boolean commonEnd(Integer[] input1, Integer[] input2){       //change b to B
+        boolean common = false;
+        if (input1[0] == input2[0] || input1[input1.length-1] == input2[input2.length-1]){
+                common = true;
+        }
+        return common;
     }
 
     /**
@@ -39,6 +56,13 @@ public class ArrayDrills {
      *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
      */
     public Integer[] rotateLeft(Integer[] input){
+        Integer last = 0;
+        Integer[] temp = input.length;
+        for (int i = 0; i < input.length;i++){
+            last = input[0];
+            array = ArrayUtils.removeElement(input,input[0]);
+
+        }
         return null;
     }