diff --git a/src/main/java/com/zipcodewilmington/StringArrayUtils.java b/src/main/java/com/zipcodewilmington/StringArrayUtils.java
index 4bcce66..4978e47 100644
--- a/src/main/java/com/zipcodewilmington/StringArrayUtils.java
+++ b/src/main/java/com/zipcodewilmington/StringArrayUtils.java
@@ -1,5 +1,9 @@
 package com.zipcodewilmington;
 
+import com.sun.deploy.security.SelectableSecurityManager;
+
+import java.util.Arrays;
+
 /**
  * Created by leon on 1/29/18.
  */
@@ -25,7 +29,7 @@ public static String getSecondElement(String[] array) {
      * @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 static String getLastElement(String[] array) {
      * @return second to last element in specified array
      */ // TODO
     public static String getSecondToLastElement(String[] array) {
-        return null;
+        return array[array.length - 2];
     }
 
     /**
@@ -42,6 +46,19 @@ public static String getSecondToLastElement(String[] array) {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
+     /*   int counter=0;
+        for(int i=0 ;i < array.length ;i++)
+        {
+            if(array[i].contains(value))
+                counter++;
+        }
+        return counter==0 ? false:true; */
+
+        for (String s : array) {
+            if (s == value) {
+                return true;
+            }
+        }
         return false;
     }
 
@@ -50,7 +67,16 @@ public static boolean contains(String[] array, String value) {
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        int lengthA = array.length;
+
+        String[] reverseArray = new String[lengthA];
+        int j = 0;
+        for (int i = array.length - 1; i >= 0; i--) {
+            reverseArray[j] = array[i];
+            j++;
+        }
+        // reverseArray.equals(array);
+        return reverseArray;
     }
 
     /**
@@ -58,24 +84,112 @@ public static String[] reverse(String[] array) {
      * @return true if the order of the array is the same backwards and forwards
      */ // TODO
     public static boolean isPalindromic(String[] array) {
-        return false;
+        //Method one , use reverse method from above and check if Arrays.equals()
+        //String[] reversedArray = reverse(array);
+        //return Arrays.equals(reversedArray,array);
+
+
+        //Method 2 , use Arrays,equal and reverse in build method to check if they are equal
+        //  return Arrays.equals(reverse(array) , array);
+
+
+        //Method 3 - to work with same array and divide by half to see if its same from left-right and right-left
+        Boolean flag = true;
+        int n = array.length;
+        int arraymid = n / 2;
+        for (int i = 0; i < arraymid; i++) {
+            if (array[i] != array[n - 1 - i]) {
+                flag = false;
+                break;
+            }
+        }
+        return flag;
     }
 
+
     /**
      * @param array array of String objects
      * @return true if each letter in the alphabet has been used in the array
      */ // TODO
     public static boolean isPangramic(String[] array) {
-        return false;
+
+        //Method 1 , Append the array contents in StringBuilder and after removing spaces ,sort it , once sorted check if it matches to a-z
+        StringBuilder storeString = new StringBuilder();
+        for (int i = 0; i < array.length; i++) {
+            storeString.append(array[i]);
+        }
+
+        String sortString = storeString.toString().replaceAll(" ", "");
+//        char[] storeAltered = new char[sortString.length()];
+//        int j=1;
+//        char[] chars=sortString.toLowerCase().toCharArray();
+//        Arrays.sort(chars);
+//
+//        storeAltered[0]=chars[0];
+//        for (int i = 1; i < chars.length ;i++) {
+//            if ( !(chars[i] == chars[i - 1])) {
+//                storeAltered[j] = chars[i];
+//                j++;
+//            }
+//        }
+//        String finalString=chars.toString().trim();//String.valueOf(storeAltered).trim();
+//        return finalString.equals("abcdefghijklmnopqrstuvwxyz");
+//
+//METHOD 2 - set flag to true for the letter found and if any flg is false, return false.
+        // Create a hash table to mark the
+        // characters present in the string
+        // By default all the elements of
+        // mark would be false.
+        boolean[] mark = new boolean[26];
+
+        // For indexing in mark[]
+        int index = 0;
+        String str = sortString;
+        // Traverse all characters
+        for (int i = 0; i < str.length(); i++) {
+            // If uppercase character, subtract 'A'
+            // to find index.
+            if (str.charAt(i) >= 'A'  && str.charAt(i) <= 'Z')
+                index = str.charAt(i) - 'A';
+
+                // If lowercase character, subtract 'a'
+                // to find index.
+            else if (str.charAt(i) >='a' && str.charAt(i) <= 'z')
+
+                index = str.charAt(i) - 'a';
+
+                // If this character is other than english
+                // lowercase and uppercase characters.
+            else
+                continue;
+            mark[index] = true;
+        }
+
+        // Return false if any character is unmarked
+        for (int i = 0; i <= 25; i++)
+            if (mark[i] == false)
+                return (false);
+
+        // If all characters were present
+        return (true);
     }
 
+
+
+
     /**
      * @param array array of String objects
      * @param value value to check array for
      * @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 s : array) {
+            if (s == value) {
+                counter++;
+            }
+        }
+        return counter;
     }
 
     /**
@@ -84,7 +198,19 @@ public static int getNumberOfOccurrences(String[] array, String value) {
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+        int arrayLength= array.length;
+        String[] storeAltered= new String[arrayLength-1];
+        int j=0;
+        for (int i = 0; i < arrayLength ;i++) {
+            if(array[i] == valueToRemove)
+               continue;
+            else {
+                storeAltered[j] = array[i];
+                j++;
+
+            }
+        }
+        return storeAltered;
     }
 
     /**
@@ -92,7 +218,21 @@ public static String[] removeValue(String[] array, String valueToRemove) {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+
+        String[] storeAltered= new String[array.length];
+        int j=0;
+        for (int i = 0; i < array.length ;i++) {
+            if (i==0 || !array[i].equals(array[i - 1]) ) {
+                storeAltered[j] = array[i];
+                j++;
+             }
+        }
+        //Creating output with the new size array based on result.
+        String[] output = new String[j];
+        for(int i = 0; i < j; i++){
+            output[i] = storeAltered[i];
+        }
+        return output;
     }
 
     /**
@@ -100,8 +240,31 @@ public static String[] removeConsecutiveDuplicates(String[] array) {
      * @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[] buffer = new String[array.length];
+        String lastSeen = array[0];
+        String stringToAdd = "";
+        int outputLength = 0;
+
+
+        for(int i = 0; i < array.length; i++){
+            if (array[i].equals(lastSeen))
+                stringToAdd += lastSeen;
+            else {
+                buffer[outputLength++] = stringToAdd;
+                lastSeen = array[i];
+                stringToAdd = array[i];
+            }
+        }
+        buffer[outputLength++] = stringToAdd;
+
+        //Creating output with the new size array based on result.
+        String[] output = new String[outputLength];
+        for(int i = 0; i < outputLength; i++){
+            output[i] = buffer[i];
+        }
+        return output;
     }
 
 
+
 }
diff --git a/src/test/java/com/zipcodewilmington/IsPalindromicTest.java b/src/test/java/com/zipcodewilmington/IsPalindromicTest.java
index 5261d05..0ec1c3f 100644
--- a/src/test/java/com/zipcodewilmington/IsPalindromicTest.java
+++ b/src/test/java/com/zipcodewilmington/IsPalindromicTest.java
@@ -29,6 +29,12 @@ public void testIsPalindromic3() {
         boolean outcome = StringArrayUtils.isPalindromic(array);
         Assert.assertFalse(outcome);
     }
+    @Test
+    public void testIsPalindromic4() {
+        String[] array = {"Is this a plaindrome?", "This is not a plaindrome", "This is not a plaindrome", "Is this a plaindrome?"};
+        boolean outcome = StringArrayUtils.isPalindromic(array);
+        Assert.assertTrue(outcome);
+    }
 
 
 }
diff --git a/src/test/java/com/zipcodewilmington/IsPangramicTest.java b/src/test/java/com/zipcodewilmington/IsPangramicTest.java
index 70677d7..70688dc 100644
--- a/src/test/java/com/zipcodewilmington/IsPangramicTest.java
+++ b/src/test/java/com/zipcodewilmington/IsPangramicTest.java
@@ -14,7 +14,7 @@ public void testIsPangramic1() {
 
     @Test
     public void testIsPangramic2() {
-        String[] array = {"The", "quick", "onyx", "goblin", "jumps", "over", "the", "lazy", "dwarf"};
+        String[] array = {"The", "quick*^^&*&^", "onyx", "goblin", "jumps", "over", "the", "lazy", "dwarf"};
         boolean outcome = StringArrayUtils.isPangramic(array);
         Assert.assertTrue(outcome);
     }