finished lab

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

@@ -1,7 +1,80 @@
 package com.zipcodewilmington.arrayutility;
 
+
+import com.sun.tools.javac.util.ArrayUtils;
+
+import java.lang.reflect.Array;
+import java.util.*;
+
 /**
  * Created by leon on 3/6/18.
  */
-public class ArrayUtility {
+public class ArrayUtility<T> {
+
+    private T[] inputArray;
+
+    public ArrayUtility(T[] inputArray){
+        this.inputArray = inputArray;
+    }
+
+    public Object[] merge(T[] arrayToMerge, T[] inputArray) {
+        ArrayList<T> t1 = new ArrayList<>(Arrays.asList(arrayToMerge));
+        t1.addAll(Arrays.asList(inputArray));
+        return t1.toArray(new Object[t1.size()]);
+    }
+
+    public T[] removeValue(T valueToRemove) {
+            int counter = 0;
+            for(int i = 0; i < inputArray.length; i++){
+                if(inputArray[i]!= valueToRemove){
+                    inputArray[counter] = inputArray[i];
+                    counter++;
+                }
+            }
+            return Arrays.copyOf(inputArray, counter);
+        }
+
+    public Integer countDuplicatesInMerge(T[] arrayToMerge, T valueToEvaluate) {
+        Object[] mergedArray = merge(arrayToMerge, inputArray);
+        int counter = 0;
+        for(int i = 0; i < mergedArray.length; i++)
+        {
+            if(mergedArray[i].equals(valueToEvaluate))
+            {
+                counter++;
+            }
+        }
+        return counter;
+    }
+
+    public T getMostCommonFromMerge(T[] arrayToMerge) {
+        merge(arrayToMerge, inputArray);
+        int count = 0, tempCount;
+        T common = arrayToMerge[0];
+        T temp = null;
+        for (int i = 0; i < (arrayToMerge.length - 1); i++) {
+            temp = arrayToMerge[i];
+            tempCount = 0;
+            for (int j = i + 1; j < arrayToMerge.length; j++) {
+                if (temp == arrayToMerge[j])
+                    tempCount++;
+            }
+            if (tempCount > count) {
+                common = temp;
+                count = tempCount;
+            }
+        }
+        return common;
+    }
+
+    public Integer getNumberOfOccurrences(T valueToEvaluate) {
+        int counter = 0;
+        for(int i = 0; i < inputArray.length; i++){
+            if (valueToEvaluate == inputArray[i]){
+                counter++;
+            }
+        }
+        return counter;
+    }
+
 }

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;
 
 /**