all but last 2

StringArrayUtils.java

@@ -1,4 +1,6 @@
- 
+import java.util.Arrays;
+import java.io.*;
+import java.util.*; 
 
 /**
  * Created by leon on 1/29/18.
@@ -9,7 +11,7 @@ public class StringArrayUtils {
      * @return first element of specified array
      */ // TODO
     public static String getFirstElement(String[] array) {
-        return null;
+        return array[0];
     }
 
     /**
@@ -17,7 +19,7 @@ public class StringArrayUtils {
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+        return array[1];
     }
 
     /**
@@ -25,7 +27,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 +35,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 +44,13 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
-        return false;
+        boolean contains = false;
+        for(String element : array){
+            if(element.equals(value)){
+                contains = true;
+            }
+        }
+        return contains;
     }
 
     /**
@@ -50,7 +58,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 j=array.length-1, i=0; j>=0; j--, i++){    
+            reverse[i] = array[j];
+        }
+        return reverse;
     }
 
     /**
@@ -58,7 +70,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;
+        boolean isPalindromic = false;
+        String[] reverse = reverse(array);
+        if (Arrays.equals(array,reverse)){
+            isPalindromic = true;
+        }
+        return isPalindromic;
     }
 
     /**
@@ -66,7 +83,19 @@ 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 arrayString = Arrays.toString(array).toLowerCase();
+        
+        if(arrayString.length() < 26){
+            return false;
+        }
+
+        for (char c = 'a'; c <='z'; c++){
+            if(arrayString.indexOf(c) < 0){
+                return false;
+            }
+        }
+        
+        return true;
     }
 
     /**
@@ -75,7 +104,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 numberOfOccurrences = 0;
+
+        for (String element : array){
+            if(element.equals(value)){
+                numberOfOccurrences += 1;
+            }
+        }
+        
+        return numberOfOccurrences;
     }
 
     /**
@@ -84,7 +121,27 @@ public class StringArrayUtils {
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+        int numberOfOccurrences = getNumberOfOccurrences(array, valueToRemove);
+        String[] newArray = new String[array.length - numberOfOccurrences];
+        
+        int i = 0;
+        for(String element : array){
+            if(!element.equals(valueToRemove)){
+                newArray[i] = element;
+                i++;
+            }
+        }
+        return newArray;
+    }
+    
+    public static int numberOfConsecutiveDuplicates(String[] array) {
+        int numberOfConsecDups = 0;
+        for(int i=1; i<=array.length-1; i++){
+            if(array[i].equals(array[i-1])){
+                numberOfConsecDups += 1;
+            }
+        }
+        return numberOfConsecDups;
     }
 
     /**
@@ -92,7 +149,7 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        
     }
 
     /**
@@ -103,5 +160,4 @@ public class StringArrayUtils {
         return null;
     }
 
-
 }

package.bluej

@@ -0,0 +1,42 @@
+#BlueJ package file
+dependency1.from=StringArrayUtilsTest
+dependency1.to=StringArrayUtils
+dependency1.type=UsesDependency
+editor.fx.0.height=713
+editor.fx.0.width=800
+editor.fx.0.x=466
+editor.fx.0.y=35
+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=202
+package.editor.y=149
+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=130
+target1.y=10
+target2.height=50
+target2.name=StringArrayUtils
+target2.showInterface=false
+target2.type=ClassTarget
+target2.width=120
+target2.x=70
+target2.y=70