by George, i got it

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

@@ -1,7 +1,81 @@
 package com.zipcodewilmington.arrayutility;
 
+import java.util.ArrayList;
+import java.util.Arrays;
+
 /**
  * Created by leon on 3/6/18.
  */
-public class ArrayUtility {
+public class ArrayUtility<T> {
+    private T[] genericArray;
+
+    public ArrayUtility(T[] inputArray){
+        this.genericArray = inputArray;
+    }
+
+    public Integer countDuplicatesInMerge(T[] arrayToMerge, T valueToEvaluate){
+        T[] mergedArray = mergeArrays(genericArray, arrayToMerge);
+        Integer howManyTimesThisValueShowsUp = 0;
+        for(T value : mergedArray){
+            if(value == valueToEvaluate){
+                howManyTimesThisValueShowsUp++;
+            }
+        }
+        return howManyTimesThisValueShowsUp;
+    }
+
+    public T getMostCommonFromMerge(T[] arrayToMerge){
+        T[] mergedArray = mergeArrays(genericArray, arrayToMerge);
+        int count = 0;
+        int tempCount;
+        T mostFreq = mergedArray[0];
+        T currentObjectObserved;
+        //search for the most freq
+        for(int i = 0; i < mergedArray.length; i++){
+            currentObjectObserved = mergedArray[i];
+            tempCount = 1;
+            for(int j = 1; j <mergedArray.length; j++){
+                if(currentObjectObserved == mergedArray[j]){
+                    tempCount++;
+                }
+            }
+            if(tempCount > count){
+                mostFreq = currentObjectObserved;
+                count = tempCount;
+            }
+        }
+        return mostFreq;
+    }
+
+    public Integer getNumberOfOccurrences(T valueToEvaluate){
+        Integer howManyTimesThisValueShowsUp = 0;
+        for(T value : genericArray){
+            if(value == valueToEvaluate){
+                howManyTimesThisValueShowsUp++;
+            }
+        }
+        return howManyTimesThisValueShowsUp;
+    }
+
+    public T[] removeValue(T valueToRemove){
+        Integer numberOfOccurrences = getNumberOfOccurrences(valueToRemove);
+        T[] returnArray = Arrays.copyOf(genericArray, genericArray.length-numberOfOccurrences);
+        int indexCount = 0;
+        for(T value : genericArray){
+            if(!value.equals(valueToRemove)){
+                returnArray[indexCount] = value;
+                indexCount++;
+            }
+        }
+        return returnArray;
+    }
+
+
+    public T[] mergeArrays(T[] originalArray, T[] arrayToMerge){
+        ArrayList<T> merged = new ArrayList<>();
+        merged.addAll(Arrays.asList(originalArray));
+        merged.addAll(Arrays.asList(arrayToMerge));
+        T[] mergedArray = (T[]) merged.toArray();
+        return mergedArray;
+    }
 }

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

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