Completed lab and passed all test.

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

@@ -1,7 +1,102 @@
 package com.zipcodewilmington.arrayutility;
 
+import java.lang.reflect.Array;
+import java.util.ArrayList;
+
 /**
- * Created by leon on 3/6/18.
+ * Completed by William on 11/13/2018.
  */
-public class ArrayUtility {
+public class ArrayUtility<T>{
+
+    private T t;
+    private T[] inputArray;
+
+    public T getT() {
+        return t;
+    }
+
+    public void setT(T t1) {
+        this.t = t1;
+    }
+
+    public ArrayUtility(T[] inputArray) {
+        this.inputArray = inputArray;
+    }
+
+    public Integer countDuplicatesInMerge(T[] arrayToMerge, T valueToEvaluate) {
+        T[] merged = merge(inputArray, arrayToMerge);
+        Integer dups = duplicates(merged, valueToEvaluate);
+        return dups;
+    }
+
+    public Integer duplicates(T[] merged, T valueToEvaluate) {
+        int counter = 0;
+        for (int i = 0; i < merged.length; i++) {
+            if(merged[i] == valueToEvaluate){
+                counter++;
+            }
+        }
+        return counter;
+    }
+
+    public T[] merge(T[] array1, T[] array2) {
+        T[] output = (T[])Array.newInstance(this.inputArray.getClass().getComponentType(), (inputArray.length)+(array2.length));
+        int counter = 0;
+        for (int i = 0; i < output.length; i++) {
+            if(i < array1.length){
+                output[i] = array1[i];
+            }else{
+                output[i] = array2[i - array1.length];
+            }
+        }
+        return output;
+    }
+
+    public T getMostCommonFromMerge(T[] arrayToMerge) {
+        return mostCommon(merge(inputArray, arrayToMerge));
+    }
+
+    public T mostCommon(T[] array) {
+        int counter = 0;
+        int tempCounter = 0;
+        T top = array[0];
+        T current = array[0];
+        for(int i = 0; i < array.length; i++){
+            for(int j = 0; j < array.length; j++){
+                if(array[j].equals(current)){
+                    tempCounter++;
+                }
+            }
+            if(tempCounter > counter){
+                top = current;
+                counter = tempCounter;
+            }
+            tempCounter = 0;
+            current = array[i];
+        }
+        return top;
+    }
+
+    public Integer getNumberOfOccurrences(T valueToEvaluate) {
+        int counter = 0;
+        for(int i = 0; i < inputArray.length; i++){
+            if(inputArray[i] == valueToEvaluate){
+                counter++;
+            }
+        }
+        return counter;
+    }
+
+    public T[] removeValue(T valueToRemove) {
+        int number = getNumberOfOccurrences(valueToRemove);
+        T[] output = (T[])Array.newInstance(this.inputArray.getClass().getComponentType(), inputArray.length - number);
+        int counter = 0;
+        for(int i = 0; i < inputArray.length; i++){
+            if(inputArray[i] != valueToRemove){
+                output[counter] = inputArray[i];
+                counter++;
+            }
+        }
+        return output;
+    }
 }

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{
     @Test
     public void integerTest() {
         // Given

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