DONE

StringArrayUtils.java

@@ -1,4 +1,4 @@
-
+import java.util.Arrays;
 /**
  * Created by leon on 1/29/18.
  */
@@ -89,16 +89,12 @@ public class StringArrayUtils {
          */
         boolean returnPal = false;
         String [] reverseArray = reverse(array);
-        /*
-         * 
-         */
         for(int i = 0; i < array.length; i++){
-            System.out.println("array[i] " + array[i] + " reverseArray[i] " + reverseArray[i]);
+            // System.out.println("array[i] " + array[i] + " reverseArray[i] " + reverseArray[i]);
             if(array[i].equals(reverseArray[i])){
                 returnPal = true;
             }
         }
-
         return returnPal;
     }
 
@@ -111,21 +107,28 @@ public class StringArrayUtils {
          * if(isPangramic.length() < letters){
          *  }
          */
-        int letters = 26;
-        boolean pangram = false;
-
-        if(array.length < letters){
-            pangram = true;
-        }
-        if(array.length == letters){
-            pangram = false;
-        }else{
-
-            pangram = true;
-
+        //        int letters = 26;
+        //        boolean pangram = false;
+        //
+        //        if(array.length < letters){
+        //            pangram = true;
+        //        }
+        //        if(array.length == letters){
+        //            pangram = false;
+        //        }else{
+        //            pangram = true;
+        //        }
+        //        return pangram;
+        String stringToArray = array.toString();
+        String str = stringToArray.toLowerCase();
+        boolean answer = false;
+        for (char start = 'a';start <='z';++start){
+            if (!str.contains(String.valueOf(start))){
+                answer = true;
+                break;
+            }
         }
-
-        return pangram;
+        return answer;
     }
 
     /**
@@ -134,9 +137,7 @@ public class StringArrayUtils {
      * @return number of occurrences the specified `value` has occurred
      */ // TODO
     public static int getNumberOfOccurrences(String[] array, String value) {
-        /*
-         * 
-         */
+
         int count = 0;
         for(int i = 0;i < array.length;i++){
             if(array[i] == value){
@@ -153,21 +154,19 @@ public class StringArrayUtils {
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
         StringBuilder sb = new StringBuilder();
-        
+
         //Looping through array
         for(int index = 0;index < array.length;index++){
             //if the array value does not equal
             //the value to remove, then add the values to a temp array
-           
+
             if(array[index] != valueToRemove ){
-             sb.append(array[index] + "~");
-                
+                sb.append(array[index] + "~");
+
             }
-            
-            
+
         }
         String answer = sb.toString();
-        
         String [] temp = answer.split("~");
         return temp;
     }
@@ -177,10 +176,34 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        
-        
-        
-        return null;
+        //created emptry array with length of array
+        //created an
+        String [] answer = new String[array.length];
+        int i = 0;
+        answer[i]=array[0];
+         i++; 
+        for(int j=1;j<array.length;j++){
+             if(!answer[i-1].equals(array[j])){
+                answer[i]=array[j];
+                 i++; 
+                }
+            }
+        String [] newArray = new String [i];
+        //copies a source array from a specific beginning position to the destination array
+        // from the mentioned position.
+        // No. of arguments to be copied are decided by len argument.
+        System.arraycopy(answer, 0, newArray, 0, i);
+        return newArray;
+    }
+    
+    public static int counter(String[] array){
+         int counter = 0;
+        for(int index = 0; index < array.length-1; index++){
+            if(array[index].equals(array[index+1])){
+            counter = counter+=1;
+          }
+        }          
+        return counter; 
     }
 
     /**
@@ -188,7 +211,22 @@ public class StringArrayUtils {
      * @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;
+           StringBuilder pack = new StringBuilder(array[0]);
+           String [] answer = new String[array.length-counter(array)];
+           int index = 0;  
+           for(int i=1;i<array.length;i++){
+            if(array[i-1].equals(array[i])){           
+                pack.append(array[i]);
+                
+            } else{            
+                answer[index] = pack.toString();
+                pack.setLength(0);
+                pack.append(array[i]);
+                index++;
+            }
+            }
+             answer[index]=pack.toString();
+        return answer;
     }
 
 }

package.bluej

@@ -2,10 +2,10 @@
 dependency1.from=StringArrayUtilsTest
 dependency1.to=StringArrayUtils
 dependency1.type=UsesDependency
-editor.fx.0.height=709
-editor.fx.0.width=799
-editor.fx.0.x=481
-editor.fx.0.y=23
+editor.fx.0.height=722
+editor.fx.0.width=800
+editor.fx.0.x=240
+editor.fx.0.y=26
 objectbench.height=102
 objectbench.width=461
 package.divider.horizontal=0.6