all tests passing

pom.xml

     <groupId>com.zipcodewilmington.labs</groupId>
     <artifactId>arrayutils</artifactId>
     <version>1.0-SNAPSHOT</version>
+    <build>
+        <plugins>
+            <plugin>
+                <groupId>org.apache.maven.plugins</groupId>
+                <artifactId>maven-compiler-plugin</artifactId>
+                <configuration>
+                    <source>8</source>
+                    <target>8</target>
+                </configuration>
+            </plugin>
+        </plugins>
+    </build>
     <dependencies>
         <dependency>
             <groupId>junit</groupId>

src/main/java/com/zipcodewilmington/StringArrayUtils.java

 package com.zipcodewilmington;
 
+import java.util.ArrayList;
+import java.util.Arrays;
+
 /**
  * Created by leon on 1/29/18.
  */
      * @return first element of specified array
      */ // TODO
     public static String getFirstElement(String[] array) {
-        return null;
+
+        return array[0];
     }
 
     /**
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+
+        return array[1];
     }
 
     /**
      * @return last element in specified array
      */ // TODO
     public static String getLastElement(String[] array) {
-        return null;
+
+        return array[(array.length - 1)];
     }
 
     /**
      * @return second to last element in specified array
      */ // TODO
     public static String getSecondToLastElement(String[] array) {
-        return null;
+        return array[(array.length - 2)];
     }
 
     /**
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
+
+        for (int i = 0; i < array.length; i++)
+            if (value.equals(array[i])) {
+                return true;
+            }
         return false;
     }
 
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        String[] newStr = new String[array.length];
+        int n = 0;
+        for (int i = array.length - 1; i >= 0; i--) {
+            newStr[n] = array[i];
+            n++;
+        }
+        return newStr;
     }
 
     /**
      * @return true if the order of the array is the same backwards and forwards
      */ // TODO
     public static boolean isPalindromic(String[] array) {
-        return false;
+        String[] newStr = Arrays.copyOf(array, array.length);
+        boolean same = false;
+        int n = 0;
+        for (int i = array.length - 1; i >= 0; i--) {
+            if (array[i] != newStr[n]) {
+                return false;
+            }
+            n++;
+        }
+        return true;
     }
 
     /**
      * @return true if each letter in the alphabet has been used in the array
      */ // TODO
     public static boolean isPangramic(String[] array) {
+
+        String str = String.join(",", array);
+        String alphaStr = "abcdefghijklmnopqrstuvwxyz";
+        char[] alphaArray = alphaStr.toCharArray();
+        char[] charArray = str.toCharArray();
+
+        int count = 0;
+        for (int i = 0; i < alphaArray.length; i++) {
+            for (int j = 0; j < charArray.length; j++) {
+                if (alphaArray[i] == charArray[j]) {
+                    count++;
+                    //break;
+                }
+            }
+        }
+        if (count >= 26) {
+            return true;
+        }
         return false;
     }
 
      * @return number of occurrences the specified `value` has occurred
      */ // TODO
     public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
+        int counter = 0;
+        for (int i = 0; i < array.length; i++) {
+            if (array[i] == value) {
+                counter++;
+            }
+        }
+
+        return counter;
     }
 
     /**
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+        String[] newStr = new String[array.length];
+        int n = 0;
+        for (int i = 0; i < array.length; i++) {
+            if (array[i] != valueToRemove) {
+                newStr[n] = array[i];
+                n++;
+            }
+
+        }
+        return Arrays.copyOf(newStr, n);
+
+
     }
 
     /**
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        int counter = 0;
+        ArrayList<String> temp = new ArrayList<>();
+        temp.add(array[0]);
+
+        for (int i=1;i<array.length;i++) {
+            if (!array[i].equals(temp.get(counter))) {
+                temp.add(array[i]);
+                counter++;
+            }
+
+        }
+        String[] answer = new String[temp.size()];
+        temp.toArray(answer);
+
+        return answer;
     }
 
+
+
     /**
      * @param array array of chars
      * @return array of Strings with each consecutive duplicate occurrence concatenated as a single string in an array of Strings
      */ // TODO
     public static String[] packConsecutiveDuplicates(String[] array) {
-        return null;
-    }
 
+        int counter = 0;
+        ArrayList<String> temp = new ArrayList<>();
+        String str = array[0];
+
+
+        for (int i=1;i<array.length;i++) {
+            //if (array[i-1].charAt(0)!=(array[counter].charAt(0))) {
 
+            if (array[i].equals(array[i-1])) {
+                str=str.concat(array[i]);
+
+            } else {
+                temp.add(str);
+                str="";
+                str=str.concat(array[i]);
+            }
+        }
+        
+        temp.add(str);
+
+         array = new String[temp.size()];
+        temp.toArray(array);
+
+        return array;
+    }
 }
+
+