update

StringArrayUtils.java

@@ -50,13 +50,13 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
-       String[] arr = {"the", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"};
-       if (Arrays.asList(arr).contains("quick") == true){
-        return true;
+        String[] arr = {"the", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"};
+        if (Arrays.asList(arr).contains("quick") == true){
+            return true;
         }
         else{
         }
-       return false ;
+        return false ;
     }
 
     /**
@@ -64,7 +64,14 @@ public class StringArrayUtils {
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        for (int i=0; i<array.length/2;i++){
+            String temp = array[i];
+            array[i] = array[array.length-1-i];
+            array[array.length-1-i] = temp;
+
+        }
+
+        return array;
     }
 
     /**
@@ -72,7 +79,36 @@ public class StringArrayUtils {
      * @return true if the order of the array is the same backwards and forwards
      */ // TODO
     public static boolean isPalindromic(String[] array) {
+        String[] newArr = new String[array.length]; //newArr is a copy of original array
+        //newArray[i] = array[array.length-i-1];
+        for (int i=0;i<array.length;i++){
+            newArr[i]=array[array.length-i-1];
+
+        }
+        if (Arrays.equals(newArr,array)){
+            return true;
+
+        }
         return false;
+        
+        // if (array.length%2 ==0){
+        // for (int i=0; i<array.length/2;i++){
+        // String temp = array[i];
+        // array[i] = array[array.length-1];
+        // array[array.length-1] = temp;
+        // //reverse the original array
+        // }
+        // }
+        // if (Arrays.equals(newArr,array)){
+        // return true;
+        // }
+        // // else if(!array[0].equals(array[array.length-1])){
+        // // return false;
+        // // }
+        // else{    
+        // return false;
+        // }
+
     }
 
     /**
@@ -80,6 +116,7 @@ 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;
     }
 
@@ -117,5 +154,4 @@ public class StringArrayUtils {
         return null;
     }
 
-
 }