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

@@ -1,7 +1,75 @@
 package com.zipcodewilmington.arrayutility;
+import java.util.*;
 
-/**
- * Created by leon on 3/6/18.
- */
-public class ArrayUtility {
-}
+public class ArrayUtility <T> {
+    private T[] inputArray;
+    private T[] mergeArray;
+    private Object valueToRemove;
+
+    public ArrayUtility(){}
+    public ArrayUtility(T[] inputArray) {
+        this.inputArray =  inputArray;
+    }
+
+    public T getMostCommonFromMerge(T[] arrayToMerge) {
+        mergeArray = (T[]) new Object[inputArray.length + arrayToMerge.length];
+       System.arraycopy(inputArray, 0,mergeArray, 0, inputArray.length);
+       System.arraycopy(arrayToMerge, 0, mergeArray, inputArray.length, arrayToMerge.length);
+       // System.out.println(mergeArray);
+
+        int numberOfOccurences = 0;
+        T mostCommon = mergeArray[0];
+        for (T element : mergeArray)
+        {
+            if (getNumberOfOccurrences(element) > numberOfOccurences)
+            {
+                mostCommon = element;
+                numberOfOccurences = getNumberOfOccurrences(element);
+            }
+
+        }
+        return mostCommon;
+    }
+
+
+        public T[] removeValue (T valueToRemove){
+        Integer appearances = getNumberOfOccurrences(valueToRemove);
+            int i = 0;
+            //mergeArray = (T[]) new Object[inputArray.length-appearances];
+             mergeArray = Arrays.copyOf(inputArray, inputArray.length-appearances);
+            for (T element : inputArray) {
+                if (!element.equals(valueToRemove)) {
+                    mergeArray[i] = element;
+                    i++;
+                }
+                }
+                return mergeArray;
+            }
+
+
+        public Integer countDuplicatesInMerge (T[]arrayToMerge, T valueToEvaluate){
+            mergeArray = (T[]) new Object[inputArray.length + arrayToMerge.length];
+            System.arraycopy(inputArray, 0,mergeArray, 0, inputArray.length);
+            System.arraycopy(arrayToMerge, 0, mergeArray, inputArray.length, arrayToMerge.length);
+            Integer appearances = 0;
+            for (T element : mergeArray) {
+                if (element == valueToEvaluate) {
+                    appearances++;
+                }
+            }
+            return appearances;
+        }
+
+
+    public Integer getNumberOfOccurrences(T valueToEvaluate) {
+       // mergeArray = Arrays.copyOf(inputArray, inputArray.length);
+        Integer appearances = 0;
+        for (T element : inputArray) {
+            if (element == valueToEvaluate) {
+                appearances++;
+            }
+        }
+        return appearances;
+    }
+
+    }//end of Class

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

@@ -7,7 +7,7 @@ import org.junit.Test;
  * Created by leon on 3/1/18.
  * The purpose of this class is to thoroughly test the method getMostCommonFromMerge()
  */
-public class GetMostCommonFromMergeTest {
+public class GetMostCommonFromMergeTest <T> {
     @Test
     public void integerTest() {
         // Given
@@ -69,4 +69,4 @@ public class GetMostCommonFromMergeTest {
         // Then
         Assert.assertEquals(expected, actual);
     }
-}
+}

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

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