Done

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

@@ -1,15 +1,23 @@
 package com.zipcodewilmington;
 
+import javax.print.DocFlavor;
+import java.lang.reflect.Array;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.List;
+
 /**
  * Created by leon on 1/29/18.
  */
-public class StringArrayUtils {
+public class StringArrayUtils<start, end> {
     /**
      * @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 +25,8 @@ public class StringArrayUtils {
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+
+        return array[1];
     }
 
     /**
@@ -25,7 +34,7 @@ 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,7 @@ 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,15 +51,27 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
-        return false;
+        boolean str = false;
+        for (int x = 0; x < array.length; x++) {
+            if (value.equals(array[x])) {
+                      str = true;
+            }
+        } return str;
     }
 
     /**
      * @param array of String objects
      * @return an array with identical contents in reverse order
      */ // TODO
-    public static String[] reverse(String[] array) {
-        return null;
+    public static String[] reverse (String[] array) {
+
+        String[] str = new String[array.length];
+
+        // for (int i = 0; i < array.length; i++ ){
+        for (int i = (array.length - 1); i >= 0; i--) {
+            str[i] = array[array.length - (i + 1)];
+        }
+        return str;
     }
 
     /**
@@ -58,16 +79,38 @@ 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;
     }
 
-    /**
-     * @param array array of String objects
-     * @return true if each letter in the alphabet has been used in the array
+
+    /** // if the control reaches here, means all the elements were same
+     * @parareturn true;m array array of String objects
+     * @retu}rn 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;
+          }
 
     /**
      * @param array array of String objects
@@ -75,33 +118,88 @@ 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 str: array){
+              if(value.equals(str) )
+                  count++;
+          }
+          return count;
     }
 
     /**
-     * @param array         array of String objects
+     * @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;
-    }
 
+              List<String> list = new ArrayList<String>(Arrays.asList(array));
+
+              list.remove(valueToRemove);
+
+              array = list.toArray(new String[0]);
+
+
+              return array;
+
+   }
     /**
      * @param array array of chars
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
-    }
 
+
+        ArrayList<String> rm = new ArrayList<String>();
+        rm.add(array[0]);
+        for (int i = 1; i < array.length; i++) {
+
+            if (!array[i - 1].equals(array[i])) {
+
+                rm.add(array[i]);
+            }
+        }
+
+        String[] newArray = new String[rm.size()];
+        newArray = rm.toArray(new String[rm.size()]);
+
+        return newArray;
+    }
+    
     /**
-     * @param array array of chars
-     * @return array of Strings with each consecutive duplicate occurrence concatenated as a single string in an array of Strings
+     * @par  return newList;am array array of chars
+     * @ret}urn 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>();
+        String stri = new String();
+
+        stri = array[0];
+
+        arrayList.add(array[0]);
+        for (int i = 1; i < array.length; i++) {
+
+            if (array[i] == stri) {
+
+                arrayList.set(arrayList.size() - 1, arrayList.get(arrayList.size() - 1) + array[i]);
+
+            } else {
+
+                arrayList.add(array[i]);
+
+                stri = array[i];
+
+            }
+
+        }
+        String[] newArray = new String[arrayList.size()];
+        newArray = arrayList.toArray(new String[arrayList.size()]);
+
+        return newArray;
     }
 
 
-}
+    }

src/test/java/com/zipcodewilmington/StringArrayUtilsTest.java

@@ -34,18 +34,6 @@ public class StringArrayUtilsTest {
     }
 
 
-
-
-
-
-
-
-
-
-
-
-
-
     @Test
     public void testGetSecondElement1() {
         String[] array = {"the", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"};
@@ -72,15 +60,6 @@ public class StringArrayUtilsTest {
     }
 
 
-
-
-
-
-
-
-
-
-
     @Test
     public void testGetLastElement1() {
         String[] array = {"the", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"};
@@ -107,25 +86,6 @@ public class StringArrayUtilsTest {
     }
 
 
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
     @Test
     public void testGetSecondToLastElement1() {
         String[] array = {"the", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"};
@@ -152,21 +112,6 @@ public class StringArrayUtilsTest {
     }
 
 
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
     @Test
     public void testContains() {
         String[] array = {"the", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"};
@@ -176,18 +121,6 @@ public class StringArrayUtilsTest {
         }
     }
 
-
-
-
-
-
-
-
-
-
-
-
-
     @Test
     public void testReverse1() {
         String[] array = {"the", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"};
@@ -213,15 +146,6 @@ public class StringArrayUtilsTest {
         Assert.assertEquals(expected, actual);
     }
 
-
-
-
-
-
-
-
-
-
     @Test
     public void testIsPalindromic1() {
         String[] array = {"a", "b", "c", "b", "a"};
@@ -248,12 +172,6 @@ public class StringArrayUtilsTest {
 
 
 
-
-
-
-
-
-
     @Test
     public void testIsPangramic1() {
         String[] array = {"The quick brown", "Fox jumps over", "The lazy dog"};
@@ -284,17 +202,6 @@ public class StringArrayUtilsTest {
     }
 
 
-
-
-
-
-
-
-
-
-
-
-
     @Test
     public void testGetNumberOfOccurrences1() {
         String[] array = {"aba", "aba", "baa", "bab", "bba", "bba", "bba", "bba", "bbb", "bbb"};
@@ -320,18 +227,6 @@ public class StringArrayUtilsTest {
     }
 
 
-
-
-
-
-
-
-
-
-
-
-
-
     @Test
     public void testRemoveConsecutiveDuplicates1() {
         String[] array = {"aba", "aba", "baa", "bab", "bba", "bba", "bba", "bba", "bbb", "bbb"};
@@ -359,16 +254,6 @@ public class StringArrayUtilsTest {
         Assert.assertEquals(actual, expected);
     }
 
-
-
-
-
-
-
-
-
-
-
     @Test
     public void testRemovePackDuplicates1() {
         String[] array = {"a", "a", "a", "b", "c", "c", "a", "a", "d"};
@@ -396,13 +281,6 @@ public class StringArrayUtilsTest {
         Assert.assertEquals(expected, actual);
     }
 
-
-
-
-
-
-
-
     @Test
     public void testRemoveValue() {
         String[] array = {"The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"};
@@ -427,15 +305,4 @@ public class StringArrayUtilsTest {
         Assert.assertEquals(expected, actual);
     }
 
-
-
-
-
-
-
-
-
-
-
-
 }