only 1 left

StringArrayUtils.java

@@ -1,5 +1,6 @@
- 
-
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
 /**
  * Created by leon on 1/29/18.
  */
@@ -9,7 +10,7 @@ public class StringArrayUtils {
      * @return first element of specified array
      */ // TODO
     public static String getFirstElement(String[] array) {
-        return null;
+        return array[0];
     }
 
     /**
@@ -17,7 +18,7 @@ public class StringArrayUtils {
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+        return array[1];
     }
 
     /**
@@ -25,7 +26,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 +34,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,6 +43,11 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
+        for (String ithString : array) {
+            if (ithString.equals(value)) {
+                return true;
+            }
+        }
         return false;
     }
 
@@ -50,7 +56,11 @@ public class StringArrayUtils {
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        String[] reverse = new String[array.length];
+        for (int i = 0; i < array.length; i++) {
+            reverse[i] = array[array.length - 1 - i];
+        }
+        return reverse;
     }
 
     /**
@@ -58,7 +68,13 @@ 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;
+        String[] reverse = reverse(array);
+        for (int i = 0; i < array.length; i++) {
+            if (!array[i].equals(reverse[i])) {
+                return false;
+            }
+        }
+        return true;
     }
 
     /**
@@ -66,6 +82,20 @@ public class StringArrayUtils {
      * @return true if each letter in the alphabet has been used in the array
      */ // TODO
     public static boolean isPangramic(String[] array) {
+        //stringbuilder holding all letters of alpha
+        StringBuilder alphabet = new StringBuilder("abcdefghijklmnopqrstuvwxyz");
+        //iterate over each word of the array and then each char of word
+        for (String word : array) {
+            for (int i = 0; i < word.length(); i++) {
+                int index = alphabet.indexOf("" + word.toLowerCase().charAt(i));
+                if (index >= 0) {
+                    alphabet.deleteCharAt(index);
+                }
+                if (alphabet.length() == 0) {
+                    return true;
+                }
+            }
+        }
         return false;
     }
 
@@ -75,7 +105,13 @@ public class StringArrayUtils {
      * @return number of occurrences the specified `value` has occurred
      */ // TODO
     public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
+        int occurrences = 0;
+        for (String word : array) {
+            if (value.equals(word)) {
+                occurrences++;
+            }
+        }
+        return occurrences;
     }
 
     /**
@@ -84,7 +120,16 @@ public class StringArrayUtils {
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+        List<String> arrRemoved = new ArrayList<String>();
+        for (String word : array) {
+            if (!word.equals(valueToRemove)) {
+                arrRemoved.add(word);
+            }
+        }
+        String[] removedArray = new String[arrRemoved.size()];
+        removedArray = arrRemoved.toArray(removedArray);
+        return removedArray;
+             
     }
 
     /**
@@ -92,7 +137,17 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        List<String> removedValues = new ArrayList<String>();
+        for (String word : array) {
+            //empty or last added value doesnt equal iterated word of array
+            if (removedValues.isEmpty() || 
+            !removedValues.get(removedValues.size() - 1).equals(word)) {
+                removedValues.add(word);
+            }
+        }
+        String[] nonDuplicate = new String[removedValues.size()];
+        nonDuplicate = removedValues.toArray(nonDuplicate);
+        return nonDuplicate;
     }
 
     /**
@@ -100,8 +155,10 @@ 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) {
+        for (String singleChar : array) {
+            
+        }
         return null;
     }
 
-
 }