Still need to work on packConsecutiveDuplicates!

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

@@ -1,15 +1,22 @@
 package com.zipcodewilmington;
 
+import com.sun.deploy.util.ArrayUtil;
+
+import java.lang.reflect.Array;
+import java.util.ArrayList;
+
 /**
  * Created by leon on 1/29/18.
  */
 public class StringArrayUtils {
+
     /**
      * @param array array of String objects
      * @return first element of specified array
      */ // TODO
     public static String getFirstElement(String[] array) {
-        return null;
+
+        return array[0];
     }
 
     /**
@@ -17,7 +24,8 @@ public class StringArrayUtils {
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+
+        return array[1];
     }
 
     /**
@@ -25,7 +33,8 @@ public class StringArrayUtils {
      * @return last element in specified array
      */ // TODO
     public static String getLastElement(String[] array) {
-        return null;
+
+        return array[array.length - 1];
     }
 
     /**
@@ -33,7 +42,8 @@ public class StringArrayUtils {
      * @return second to last element in specified array
      */ // TODO
     public static String getSecondToLastElement(String[] array) {
-        return null;
+
+        return array[array.length - 2];
     }
 
     /**
@@ -42,6 +52,10 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
+        for (String n : array) {
+            if (value == n)
+                return true;
+        }
         return false;
     }
 
@@ -50,7 +64,11 @@ public class StringArrayUtils {
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        String a[] = new String[array.length];
+        for (int i = 0; i < a.length; i++) {
+            a[i] = array[array.length - 1 - i];
+        }
+        return a;
     }
 
     /**
@@ -58,7 +76,12 @@ public class StringArrayUtils {
      * @return true if the order of the array is the same backwards and forwards
      */ // TODO
     public static boolean isPalindromic(String[] array) {
-        return false;
+        for (int i = 0; i < array.length / 2; i++) {
+            if (array[i] != array[array.length - 1 - i])
+                return false;
+
+        }
+        return true;
     }
 
     /**
@@ -66,6 +89,23 @@ public class StringArrayUtils {
      * @return true if each letter in the alphabet has been used in the array
      */ // TODO
     public static boolean isPangramic(String[] array) {
+
+        String[] arr = {"a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"};
+
+        int count = 0;
+
+        for (int i = 0; i < arr.length; i++) {
+            for (int j = 0; j < array.length; j++) {
+                if (array[j].contains(arr[i])) {
+                    count++;
+                }
+
+            }
+        }
+        if (count >= 26) {
+            return true;
+        }
+
         return false;
     }
 
@@ -75,7 +115,15 @@ public class StringArrayUtils {
      * @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 n : array) {
+            if (n.equals(value)) {
+                count += 1;
+            }
+        }
+
+        return count;
+
     }
 
     /**
@@ -84,7 +132,21 @@ public class StringArrayUtils {
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+
+        ArrayList<String> list = new ArrayList<String>();
+
+        for (int i = 0; i < array.length; i++) {
+            if (array[i] != (valueToRemove)) {
+                list.add(array[i]);
+            }
+
+        }
+        String[] newStr = new String[list.size()];
+        for (int i = 0; i < list.size(); i++) {
+            newStr[i] = list.get(i);
+        }
+
+        return newStr;
     }
 
     /**
@@ -92,7 +154,18 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+
+        ArrayList<String> list = new ArrayList<String>();
+
+
+        for (int i = 0; i < array.length; i++) {
+            if (i + 1 < array.length && array[i].equals(array[i + 1])) {
+            } else {
+                list.add(array[i]);
+            }
+        }
+        String[] result = list.toArray(new String[list.size()]);
+        return result;
     }
 
     /**
@@ -100,8 +173,28 @@ public class StringArrayUtils {
      * @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 countDups = 0;
+
+        for (int i = 0; i< array.length; i++) {
+            for(int j = i+1; j <array.length; j++) {
+                if(array[i].equals(array[j])) {
+                   countDups+=1;
+                }
+            }
+        }
+
+        String arr2[] = new String[array.length - countDups];
+
+        for (String element: array) {
+            if( element.equals(element)) {
 
-}
+            }
+        }
+
+        return arr2
+    }*/
+
+        return null;
+    }
+}