completed lab Xcuello

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

@@ -1,5 +1,8 @@
 package com.zipcodewilmington;
 
+import java.util.ArrayList;
+import java.util.List;
+
 /**
  * Created by leon on 1/29/18.
  */
@@ -9,7 +12,9 @@ public class StringArrayUtils {
      * @return first element of specified array
      */ // TODO
     public static String getFirstElement(String[] array) {
-        return null;
+
+        return array[0];
+
     }
 
     /**
@@ -17,7 +22,8 @@ public class StringArrayUtils {
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+
+        return array[1];
     }
 
     /**
@@ -25,7 +31,9 @@ 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 +41,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 +51,12 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
+
+        for (String v : array) {
+            if (value == v) {
+                return true;
+            }
+        }
         return false;
     }
 
@@ -50,15 +65,33 @@ public class StringArrayUtils {
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+
+        String temp = "";
+
+        for (int i = 0; i < array.length / 2; i++) {
+
+            temp = array[i];
+            array[i] = array[array.length - i - 1];
+            array[array.length - i - 1] = temp;
+        }
+        return array;
     }
 
+
     /**
      * @param array array of String objects
      * @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; i++) {
+            if (!array[i].equals(array[array.length - 1 - i])) {
+
+                return false;
+
+            }
+        }
+        return true;
     }
 
     /**
@@ -66,16 +99,50 @@ public class StringArrayUtils {
      * @return true if each letter in the alphabet has been used in the array
      */ // TODO
     public static boolean isPangramic(String[] array) {
-        return false;
+
+        String combo = "";
+
+        for (int i = 0; i < array.length; i++){
+            String temp = array[i].toLowerCase();
+            String[] tempArray = temp.split(" ");
+            for (int j = 0; j < tempArray.length; j++){
+                combo += tempArray[j];
+            }
+        }
+        String[] apart = combo.split("");
+
+        String[] counter = new String[26];
+        for (int i=0; i<apart.length; i++) { //z-z=0 ;  z-a=25 (26-26=0  ; 26-1=25)
+            if (counter['z' - apart[i].charAt(0)] == null) {
+                counter['z' - apart[i].charAt(0)] = apart[i];
+            }
+        }
+        for (int i=0; i<26; i++){
+            if (counter[i]==null){
+                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
     public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
+
+        int count = 0;
+
+        for (int i = 0; i < array.length; i++) {
+            if (array[i] == value) {
+                count++;
+            }
+        }
+
+
+        return count;
     }
 
     /**
@@ -84,7 +151,20 @@ 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> arrList = new ArrayList<String>();
+
+        for (int i = 0; i < array.length; i++) {
+            if (array[i] != valueToRemove) {
+
+                arrList.add(array[i]);
+
+            }
+        }
+        String[] stringArr = new String[arrList.size()];
+        stringArr = arrList.toArray(stringArr);
+
+        return stringArr;
     }
 
     /**
@@ -92,7 +172,26 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+
+        ArrayList<String> newArr = new ArrayList<String>();
+
+        newArr.add(array[0]);
+        String last = array[0];
+
+        for (int i = 1; i < array.length; i++) {
+
+            String nextWord = array[i];
+
+            if(nextWord.equals(last)) {
+                newArr.set(newArr.size()-1, newArr.get(newArr.size()-1));
+
+            } else {
+                newArr.add(nextWord);
+                last = nextWord;
+            }
+        }
+
+        return newArr.toArray(new String[newArr.size()-1]);
     }
 
     /**
@@ -100,7 +199,25 @@ 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;
+
+        ArrayList<String> newArr = new ArrayList<String>();
+
+        newArr.add(array[0]);
+        String last = array[0];
+
+        for (int i = 1; i < array.length; i++) {
+
+            String nextWord = array[i];
+
+            if(nextWord.equals(last)) {
+                newArr.set(newArr.size()-1, newArr.get(newArr.size()-1)+nextWord);
+
+            } else {
+                newArr.add(nextWord);
+                last = nextWord;
+            }
+        }
+        return newArr.toArray(new String[newArr.size()-1]);
     }
 
 

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

@@ -337,7 +337,7 @@ public class StringArrayUtilsTest {
         String[] array = {"aba", "aba", "baa", "bab", "bba", "bba", "bba", "bba", "bbb", "bbb"};
         String[] actual = StringArrayUtils.removeConsecutiveDuplicates(array);
         String[] expected = {"aba", "baa", "bab", "bba", "bbb"};
-        Assert.assertEquals(actual, expected);
+        Assert.assertArrayEquals(expected, actual);
     }