Done

src/main/java/com/zipcodewilmington/arrayutility/ArrayUtility.java

@@ -1,7 +1,85 @@
 package com.zipcodewilmington.arrayutility;
 
+
+import com.sun.jmx.remote.internal.ArrayQueue;
+
+import java.lang.reflect.Array;
+import java.util.*;
+import java.util.function.Consumer;
+
+import static jdk.nashorn.internal.objects.ArrayBufferView.length;
+
 /**
  * Created by leon on 3/6/18.
  */
-public class ArrayUtility {
+
+public class  ArrayUtility <T>{
+
+     T [] list; // generic array of name list
+
+   public ArrayUtility ( T[] list){        //constructor
+
+       this.list = list;}
+
+
+    public Integer getNumberOfOccurrences (T element){
+        Integer count = 0;
+
+        for (T el: list){  //for each loop
+            if (el.equals(element)){
+                count++; // how many number of times the particular element occur
+            }
+
+        }
+        return count;
+
+        }
+
+        public Object[] merge(T[] arr1) {
+            Object[] mergeArr = new Object[list.length + arr1.length];
+            int counter = 0;
+            for (T el: list ) {             // copying element from list to mergeArr
+                mergeArr[counter] = el;
+                counter++;                  //need to know where elements r stored in index so next arr1 can take over merging
+            }
+            for(T el: arr1){
+                mergeArr[counter] = el;     // copying element from arr1 to mergeArr
+                counter++;
+            }
+            return mergeArr;
+        }
+
+    public Integer countDuplicatesInMerge(T[] arrayToMerge, T valueToEvaluate) {
+       ArrayUtility arrayUtility = new ArrayUtility(merge(arrayToMerge)); // creating new list to add changes to the merge
+        return arrayUtility.getNumberOfOccurrences(valueToEvaluate);
+    }
+
+    public T getMostCommonFromMerge(T[] arrayToMerge) {
+        ArrayUtility arrayUtil = new ArrayUtility(merge(arrayToMerge)); // creating new list to add changes to the merge
+
+        int tempCount = 0;
+        T mostCommonObj = null;  //made generics cuzz not sure wht type we have
+        for (Object el: arrayUtil.list) { //checking to see which el has most occurrance
+            if (getNumberOfOccurrences((T)el) > tempCount){ //counting duplicates but not conseqitive dupli
+                tempCount =getNumberOfOccurrences((T) el);
+                mostCommonObj = (T) el;
+            }
+        }
+        return mostCommonObj;
+    }
+
+    public T[] removeValue(T valueToRemove) {
+        ArrayList <T> tempArr = new ArrayList<>();
+        for (int i = 0; i< list.length; i ++){
+            if (!list[i].equals(valueToRemove)) {//objects have to do .equals
+                tempArr.add(list[i]);
+            }
+
+        }
+     int newLength =tempArr.size();
+        list = (T[]) Array.newInstance(list.getClass().getComponentType(), newLength); // can't create generic array
+    return tempArr.toArray(list);
+}
 }
+
+

src/test/java/com/zipcodewilmington/arrayutility/RemoveValueTest.java

@@ -1,6 +1,6 @@
 package com.zipcodewilmington.arrayutility;
 
-import com.zipcodewilmington.UnitTestingUtils;
+//import com.zipcodewilmington.UnitTestingUtils;
 import org.junit.Test;
 
 /**