Strings again.

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

 package com.zipcodewilmington;
 
+import java.util.*;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.Map;
+
 /**
  * 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 (array[i].equals(value)) {
+
+                return true;
+            }
+        }
         return false;
     }
 
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        String[] reverseArray = new String[array.length];
+
+        int counter = 0;
+        for (int i = array.length - 1; i >= 0; i--) {
+
+            reverseArray[counter] = array[i];
+
+            counter++;
+        }
+        return reverseArray;
     }
 
     /**
      * @return true if the order of the array is the same backwards and forwards
      */ // TODO
     public static boolean isPalindromic(String[] array) {
-        return false;
+
+        String[] reverseArray = new String[array.length];
+
+        int counter = 0;
+
+        for (int i = array.length - 1; i >= 0; i--) {
+
+            reverseArray[counter] = array[i];
+
+            counter++;
+        }
+        return Arrays.equals(array, reverseArray);
     }
 
     /**
      * @return true if each letter in the alphabet has been used in the array
      */ // TODO
     public static boolean isPangramic(String[] array) {
-        return false;
-    }
 
-    /**
-     * @param array array of String objects
-     * @param value value to check array for
-     * @return number of occurrences the specified `value` has occurred
-     */ // TODO
-    public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
-    }
+        String abcs = "abcdefghijklmnopqrstuvwxyz";
 
-    /**
-     * @param array         array of String objects
-     * @param valueToRemove value to remove from array
-     * @return array with identical contents excluding values of `value`
-     */ // TODO
-    public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
-    }
+        for (int i = 0; i < abcs.length(); i++) {
 
-    /**
-     * @param array array of chars
-     * @return array of Strings with consecutive duplicates removes
-     */ // TODO
-    public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
-    }
+            int falseCount = 0;
 
-    /**
-     * @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;
+            for (int j = 0; j < array.length; j++) {
+
+                String lowerCase = array[j].toLowerCase();
+
+                if (lowerCase.indexOf(abcs.charAt(i)) == -1) {
+
+                    falseCount++;
+                }
+            }
+            if (falseCount == array.length) {
+
+                return false;
+
+
+
+            }
+        } return true;
     }
+        /**
+         * @param array array of String objects
+         * @param value value to check array for
+         * @return number of occurrences the specified `value` has occurred
+         */ // TODO
+
+        //check array to find a value
+        //take value and count how many times it is in array
+
+        public static int getNumberOfOccurrences (String[]array, String value){
+
+            int counter = 0;
+
+            for ( int i = 0; i < array.length; i++) {
+
+                if (array[i].equals(value)) {
+
+                    counter++;
+
+                }
+            } return counter;
+        }
+
+        /**
+         * @param array         array of String objects
+         * @param valueToRemove value to remove from array
+         * @return array with identical contents excluding values of `value`
+         */ // TODO
+        public static String[] removeValue (String[]array, String valueToRemove){
+            //make array list
+            ArrayList<String> temp = new ArrayList<String>();
+
+            for (int i = 0; i < array.length; i++) {
+
+                if (!array[i].equals(valueToRemove)) {
+
+                    temp.add(array[i]);
+                }
+
+            }
+                String[] newArray = temp.toArray(new String[temp.size()]);
+
+
+
+            return newArray;
+
+
+        }
+
+        /**
+         * @param array array of chars
+         * @return array of Strings with consecutive duplicates removes
+         */ // TODO
+        public static String[] removeConsecutiveDuplicates (String[]array) {
+                StringBuilder builder = new StringBuilder();
+                builder.append(array[0] + " ");
+
+                for (int i = 1; i < array.length; i++) {
+
+                    if (array[i] != array[i - 1]) {
+
+                        builder.append(array [i] + " ");
+                    }
+                }
+
+             return builder.toString().split(" ");
+        }
+        /**
+         * @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){
+
+            ArrayList<String> temp = new ArrayList<String>();
+
+            temp.add(array[0]);
+            int  tempPosition =0;
+
+            for (int i = 1; i < array.length; i++) {
+
+                if (array[i].charAt(0) == temp.get(tempPosition).charAt(0)) {
+
+                    String str = temp.get(tempPosition);
+
+                    str = str.concat(array[i]);
+
+                    temp.set(tempPosition, str);
+
+                }else {
+                    tempPosition++;
+                    temp.add(tempPosition, array[i]);
+
+                }
+            }
+
+            String [] newArray = temp.toArray(new String[temp.size()]);
+
+            return newArray;
+
+        }
 
 
-}
+    }