All Tests Pass

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

 package com.zipcodewilmington;
 
+import com.sun.xml.internal.fastinfoset.util.StringArray;
+
+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) {
-        return false;
+        boolean contains = false;
+        for (String s: array) {
+            if (s.equals(value)){
+                contains = true;
+            }
+        }
+        return contains;
     }
 
     /**
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        String[] strArrReversed = new String[array.length];
+        int x = 0;
+        for (int i = array.length - 1; i >= 0; i--){
+            strArrReversed[x] = (array[i]);
+            x++;
+        }
+
+        return strArrReversed;
     }
 
     /**
      * @return true if the order of the array is the same backwards and forwards
      */ // TODO
     public static boolean isPalindromic(String[] array) {
-        return false;
+        boolean isAPalindrom = true;
+        int countRev = array.length - 1;
+        for (int countUp = 0; countUp < array.length; countUp++){
+            if (array[countUp].equals(array[countRev]) == false){
+                isAPalindrom = false;
+            }
+            countRev--;
+        }
+        return isAPalindrom;
     }
 
     /**
      * @return true if each letter in the alphabet has been used in the array
      */ // TODO
     public static boolean isPangramic(String[] array) {
-        return false;
+        boolean isAPanGramic = true;
+        String strLower = "";
+    //Array - toLowerCase - Concat
+        for (String var : array) {
+            strLower = strLower.concat(var.toLowerCase());
+        }
+    //loop through ANSI lower case values a-z
+        // IF! contains - boolean set to false
+        for(int i = 97; i <= 122; i++){
+            if(!strLower.contains(Character.toString((char)i))){
+                isAPanGramic = false;
+            }
+        }
+        return isAPanGramic;
     }
 
     /**
      * @return number of occurrences the specified `value` has occurred
      */ // TODO
     public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
+        int count = 0;
+        for (String arrayVar: array) {
+            if (arrayVar.equals(value)){
+                count++;
+            }
+        }
+        return count;
     }
 
     /**
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+        ArrayList<String> arrayList = new ArrayList<String>();
+        for (int i = 0; i < array.length; i++) {
+            if(!array[i].equals(valueToRemove)) {
+                arrayList.add(array[i]);
+            }
+        }
+        String[] strReturn = arrayList.toArray(new String[arrayList.size()]);
+
+        return strReturn;
     }
 
     /**
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        ArrayList<String> arrayList = new ArrayList<String>();
+        arrayList.add(array[0]);
+        for (int i = 0; i < array.length - 1; i++) {
+            if (!array[i].equals(array[i+1])) {
+                arrayList.add(array[i+1]);
+            }
+        }
+        String[] strReturn = arrayList.toArray(new String[arrayList.size()]);
+
+        return strReturn;
     }
 
     /**
      * @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;
+        ArrayList<String> arrayList = new ArrayList<String>();
+        arrayList.add(array[0]);
+        for(int i = 1; i < array.length; i++)
+        {
+            if(array[i].equals(array[i-1]))
+            {
+                String str = arrayList.get(arrayList.size() - 1).concat(array[i]);
+                arrayList.set(arrayList.size() - 1, str);
+            }
+            else
+            {
+                arrayList.add(array[i]);
+            }
+        }
+        String[] strReturn = arrayList.toArray(new String[arrayList.size()]);
+        return strReturn;
     }