need to work on my habit to commit regularly

StringArrayUtils.java

- 
+import java.util.Arrays;
 
 /**
  * Created by leon on 1/29/18.
      * @return first element of specified array
      */ // TODO
     public static String getFirstElement(String[] array) {
-        return null;
+        return array[0];
     }
 
     /**
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+        return array[1];
     }
 
     /**
      * @return last element in specified array
      */ // TODO
     public static String getLastElement(String[] array) {
-        return null;
+        return array[array.length-1];
     }
 
     /**
      * @return second to last element in specified array
      */ // TODO
     public static String getSecondToLastElement(String[] array) {
-        return null;
+        return array[array.length-2];
     }
 
     /**
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
-        return false;
+        boolean output = false;
+        for (String element : array) {
+            if (element.equals(value)) {
+                output = true;
+            }
+        }
+        return output;
     }
 
     /**
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        String[] reversedArray = new String[array.length];
+        for (int i=array.length-1; i >= 0; i--) {
+            reversedArray[array.length-1-i] = array[i];
+        }
+        return reversedArray;
     }
 
     /**
      * @return true if the order of the array is the same backwards and forwards
      */ // TODO
     public static boolean isPalindromic(String[] array) {
-        return false;
+        boolean output = false;
+        String[] reversedArray = reverse(array);
+        if (Arrays.equals(array, reversedArray)) {
+            output = true;
+        }
+        return output;
     }
 
     /**
      * @return true if each letter in the alphabet has been used in the array
      */ // TODO
     public static boolean isPangramic(String[] array) {
-        return false;
+        boolean outcome = true;
+        String[] arrayGiven = new String[1];
+        arrayGiven[0]="";
+        for (int i=0; i < array.length; i++) {
+            arrayGiven[0] = arrayGiven[0].concat(array[i]);
+        }
+        arrayGiven = arrayGiven[0].toLowerCase().split("");
+        for (char alph = 'a'; alph <= 'z'; alph++) {
+            if (contains(arrayGiven, String.valueOf(alph))==false) {
+                outcome = false;
+            }
+        }
+        return outcome;
     }
 
     /**
      * @return number of occurrences the specified `value` has occurred
      */ // TODO
     public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
+        int counter = 0;
+        for (String element : array) {
+            if (element.equals(value)) {
+                counter++;
+            }
+        }
+        return counter;
     }
 
     /**
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+        int numberOfElementsToDelete = getNumberOfOccurrences(array, valueToRemove);
+        String[] arrayWithRemovedValue = new String[array.length-numberOfElementsToDelete];
+        int j=0; //index of arrayWithRemovedValue       
+        for (int i=0; i < array.length; i++) {
+            if (array[i].compareTo(valueToRemove) != 0) {
+                arrayWithRemovedValue[j] = array[i];
+                j++;
+            }
+        }
+        return arrayWithRemovedValue;
     }
 
     /**
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        int numberOfElementsToDelete = 0;
+        int j=0; //index of arrayWithRemovedVConsecutiveDuplicates
+        String[] arrayWithRemovedConsecutiveDuplicates = new String[array.length];
+        for (int i=0; i < array.length-1; i++) {
+            if (array[i].compareTo(array[i+1]) != 0) {
+                arrayWithRemovedConsecutiveDuplicates[j] = array[i];
+                j++;
+            } else {
+                numberOfElementsToDelete++;
+            }
+        }
+        arrayWithRemovedConsecutiveDuplicates = Arrays.copyOf(arrayWithRemovedConsecutiveDuplicates, array.length-numberOfElementsToDelete);
+        arrayWithRemovedConsecutiveDuplicates[arrayWithRemovedConsecutiveDuplicates.length-1] = array[array.length-1];
+        return arrayWithRemovedConsecutiveDuplicates;
     }
 
     /**
      * @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;
+        String[] arrayWithPackedConsecutiveDuplicates = new String[array.length];
+        int j=0; //index of arrayWithPackedVConsecutiveDuplicates
+        int numberOfElementsToDelete = 0;
+        arrayWithPackedConsecutiveDuplicates[0] = array[0];
+        for (int i=0; i < array.length-1; i++) {
+            if (array[i].compareTo(array[i+1]) == 0) {
+                arrayWithPackedConsecutiveDuplicates[j] = arrayWithPackedConsecutiveDuplicates[j] + array[i+1];
+                numberOfElementsToDelete++;
+            } else {
+                arrayWithPackedConsecutiveDuplicates[j+1] = array[i+1];
+                j++;
+            }
+        }
+        arrayWithPackedConsecutiveDuplicates = Arrays.copyOf(arrayWithPackedConsecutiveDuplicates, array.length-numberOfElementsToDelete);
+        return arrayWithPackedConsecutiveDuplicates;
     }
 
-
 }

StringArrayUtilsTest.java

         }
     }
 
-
+    @Test
+    public void testContains1() {
+        String[] array = {"the", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"};
+       
+            boolean outcome = StringArrayUtils.contains(array, "fox");
+            Assert.assertTrue(outcome);
+        
+    }
 
 
 
         Assert.assertEquals(expected, actual);
     }
 
-
+    @Test
+    public void testRemovePackDuplicates4() {
+        String[] array = {"m", "m", "o", "o", "n", "m", "a", "n"};
+        String[] expected = {"mm", "oo", "n", "m", "a", "n"};
+        String[] actual = StringArrayUtils.packConsecutiveDuplicates(array);
+        Assert.assertEquals(expected, actual);
+    }
 
 
 

package.bluej

+#BlueJ package file
+dependency1.from=StringArrayUtilsTest
+dependency1.to=StringArrayUtils
+dependency1.type=UsesDependency
+editor.fx.0.height=722
+editor.fx.0.width=829
+editor.fx.0.x=0
+editor.fx.0.y=74
+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=402
+package.editor.y=106
+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