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

@@ -1,7 +1,79 @@
 package com.zipcodewilmington.arrayutility;
 
+import java.lang.reflect.Array;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
 /**
  * Created by leon on 3/6/18.
  */
-public class ArrayUtility {
+public class ArrayUtility <T> {
+    private T[] inputArray;
+
+    ArrayUtility(T[] inputArray){
+        this.inputArray = inputArray;
+    }
+
+    public Integer countDuplicatesInMerge(T [] arrayToMerge, T valueToEvaluate) {
+        Integer count = 0;
+        T[] newArray = merge(inputArray,arrayToMerge);
+
+        for (int i = 0; i < newArray.length ;i++) {
+            if (newArray[i] == valueToEvaluate){
+                count++;
+            }
+        }
+        return count;
+
+    }
+    public T getMostCommonFromMerge(T[] arrayToMerge) {
+        Object[] newArray = merge(inputArray,arrayToMerge);
+        T mostCommonValue = (T) newArray[0];
+        Object temp;
+        int count = 1, tempCount;
+        int i;
+        int j;
+        for (i = 0; i <newArray.length-1 ; i++) {
+            temp = newArray[i];
+            tempCount = 0;
+            for (j = 0; j <newArray.length ; j++) {
+                if (temp == newArray[j])
+                tempCount++;
+            }
+            if (tempCount > count)
+            {
+                mostCommonValue = (T) temp;
+                count = tempCount;
+            }
+        }
+        return mostCommonValue;
+    }
+
+    public Integer getNumberOfOccurrences(T valueToEvaluate) {
+        Integer count = 0;
+        for (int i = 0; i < inputArray.length ;i++) {
+            if (inputArray[i] == valueToEvaluate){
+                count++;
+            }
+        }
+        return count;
+
+    }
+    public T[] removeValue(T valueToRemove) {
+        List<T> list = new ArrayList<>();
+        for(T element : inputArray){
+            if (!element.equals(valueToRemove)){
+                list.add(element);
+            }
+        }
+        return list.toArray((T[])Array.newInstance(inputArray.getClass().getComponentType(),list.size()));
+
+    }
+    public T[] merge(T[] inputArray, T[] arrayToMerge){
+        T[] newArr = (T[]) new Object[arrayToMerge.length + inputArray.length];
+        System.arraycopy(inputArray,0,newArr,0,inputArray.length);
+        System.arraycopy(arrayToMerge,0,newArr,inputArray.length,arrayToMerge.length);
+        return newArr;
+    }
 }

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

@@ -7,6 +7,9 @@ import org.junit.Test;
  * Created by leon on 3/1/18.
  * The purpose of this class is to thoroughly test the method countDuplicatesInMerge()
  */
+
+//mergeArray
+//contains two arraycopy
 public class CountDuplicatesInMergeTest {
     @Test
     public void integerTest() {

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