tests pass

StringArrayUtils.java

@@ -1,4 +1,4 @@
- 
+import java.util.Arrays; 
 
 /**
  * Created by leon on 1/29/18.
@@ -9,7 +9,7 @@ public class StringArrayUtils {
      * @return first element of specified array
      */ // TODO
     public static String getFirstElement(String[] array) {
-        return null;
+        return array[0];
     }
 
     /**
@@ -17,7 +17,7 @@ public class StringArrayUtils {
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+        return array[1];
     }
 
     /**
@@ -25,7 +25,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 +33,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,7 +42,14 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
-        return false;
+        boolean found = false;
+        for (String currVal : array) {
+            if (currVal.equals(value)) {
+                found = true;
+                break;
+            }
+        }
+        return found;
     }
 
     /**
@@ -50,7 +57,13 @@ 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 +71,7 @@ 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;
+       return Arrays.deepEquals(array, reverse(array));
     }
 
     /**
@@ -66,7 +79,27 @@ 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[] abc = {"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" };
+        
+        boolean pangramic = true;
+                 
+        for (String letter : abc) {
+            boolean thisLetterFound = false;
+            for (String string : array) {
+                if (string.toLowerCase().contains(letter)) {
+                    thisLetterFound = true;
+                    break;
+                }
+            }
+            if (!thisLetterFound) {
+                pangramic = false;
+                break;
+            }
+        }
+
+        return pangramic;
     }
 
     /**
@@ -75,7 +108,11 @@ 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 string : array){
+            if (string.equals(value)) count++;
+        }
+        return count;
     }
 
     /**
@@ -84,7 +121,22 @@ public class StringArrayUtils {
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+        int numOccurrences = getNumberOfOccurrences(array, valueToRemove);
+        String[] arrRemoved;
+        if (numOccurrences == 0) {
+            arrRemoved = array;
+        }
+        else {
+            arrRemoved = new String[array.length - numOccurrences];
+            int removedArrPos = 0;
+            for (int i = 0; i < array.length; i++) {
+                if (!array[i].equals(valueToRemove)) {
+                    arrRemoved[removedArrPos] = array[i];
+                    removedArrPos++;
+                }
+            }
+        }
+        return arrRemoved;
     }
 
     /**
@@ -92,7 +144,20 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        String prevString = null;
+        int consecDupCount = getConsecDupCount(array);
+        String[] removedArr = new String[array.length - consecDupCount];
+        
+        int position = 0;
+        for (int i = 0; i < array.length; i++) {
+            if (!array[i].equals(prevString)){
+                removedArr[position] = array[i];
+                prevString = array[i];
+                position++;
+            }
+        }
+        
+        return removedArr;
     }
 
     /**
@@ -100,8 +165,38 @@ 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 consecDupCount = getConsecDupCount(array);
+        String[] packedArr = new String[array.length - consecDupCount];;
+        
+        String prevString = array[0];
+        packedArr[0] = array[0];
+        int position = 0;
+        for (int i = 1; i < array.length; i++) {
+            if (array[i].equals(prevString)) {
+                packedArr[position] += prevString;
+            }
+            else {
+                position++;
+                packedArr[position] = array[i];
+                prevString = array[i];
+            }
+        }
+        
+        return packedArr;
+    }
+    
+    private static int getConsecDupCount(String[] array) {
+        String prevString = null;
+        int count = 0;
+        
+        for (String string : array) {
+            if (string.equals(prevString)){
+                count++;
+            }
+            prevString = string;
+        }
+        
+        return count;
     }
-
 
 }

package.bluej

@@ -0,0 +1,42 @@
+#BlueJ package file
+dependency1.from=StringArrayUtilsTest
+dependency1.to=StringArrayUtils
+dependency1.type=UsesDependency
+editor.fx.0.height=717
+editor.fx.0.width=971
+editor.fx.0.x=224
+editor.fx.0.y=23
+objectbench.height=101
+objectbench.width=461
+package.divider.horizontal=0.6
+package.divider.vertical=0.8007380073800738
+package.editor.height=427
+package.editor.width=674
+package.editor.x=15
+package.editor.y=102
+package.frame.height=600
+package.frame.width=800
+package.numDependencies=1
+package.numTargets=2
+package.showExtends=true
+package.showUses=true
+project.charset=UTF-8
+readme.height=58
+readme.name=@README
+readme.width=47
+readme.x=10
+readme.y=10
+target1.height=50
+target1.name=StringArrayUtilsTest
+target1.showInterface=false
+target1.type=UnitTestTargetJunit4
+target1.width=150
+target1.x=140
+target1.y=140
+target2.height=50
+target2.name=StringArrayUtils
+target2.showInterface=false
+target2.type=ClassTarget
+target2.width=120
+target2.x=70
+target2.y=70