wrote first five methods, passed tests

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

@@ -1,5 +1,9 @@
 package com.zipcodewilmington;
 
+import java.util.Arrays;
+
+import static java.util.Arrays.binarySearch;
+
 /**
  * Created by leon on 1/29/18.
  */
@@ -9,7 +13,7 @@ public class StringArrayUtils {
      * @return first element of specified array
      */ // TODO
     public static String getFirstElement(String[] array) {
-        return null;
+        return array[0];
     }
 
     /**
@@ -17,7 +21,7 @@ public class StringArrayUtils {
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+        return array[1];
     }
 
     /**
@@ -25,7 +29,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 +37,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,15 +46,32 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
-        return false;
+        boolean valuePresent = false;
+        for (int i=0; i<array.length; i++) {
+          if (array[i].equals(value)) {
+              valuePresent = true;
+                break;}
+        }
+        return valuePresent;
+
     }
 
+
+
     /**
      * @param array of String objects
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        int num = array.length;
+        String[] revArr;
+        revArr = String[num];
+        int cnt2= num-1;
+        for (int cnt1 =0; cnt1<num; cnt1++) {
+            array[cnt1]=revArr[cnt2];
+            cnt2--;
+        }
+        return revArr;
     }
 
     /**