Finished

pom.xml

@@ -21,6 +21,12 @@
             <artifactId>junit</artifactId>
             <version>4.12</version>
         </dependency>
+        <dependency>
+            <groupId>com.zipcodewilmington</groupId>
+            <artifactId>arrayutility</artifactId>
+            <version>1.0-SNAPSHOT</version>
+            <scope>test</scope>
+        </dependency>
     </dependencies>
 
 

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

@@ -1,7 +1,72 @@
 package com.zipcodewilmington.arrayutility;
 
+import java.lang.reflect.Array;
+import java.util.ArrayList;
+
 /**
  * Created by leon on 3/6/18.
  */
-public class ArrayUtility {
+public class ArrayUtility<T> {
+
+    T[] list;
+
+    public ArrayUtility(T[] list) {
+        this.list = list;
+    }
+
+    public int getNumberOfOccurrences(T element) {
+        int count = 0;
+        for (T el : list){
+            if (el.equals(element)){
+                count++;
+            }
+        }
+        return count;
+    }
+
+    public Object[] merge(T[] arr){
+        int counter = 0;
+        Object[] mergearr = new Object[list.length + arr.length];
+        for (T el : list ){
+            mergearr[counter] = el;
+            counter++;
+        }
+        for (T el: arr){
+            mergearr[counter] = el;
+            counter++;
+        }
+        return mergearr;
+    }
+
+    public int countDuplicatesInMerge(T[] arrayUtility, T valueToEvaluate) {
+        ArrayUtility arrayUtil = new ArrayUtility(merge(arrayUtility));
+        return arrayUtil.getNumberOfOccurrences(valueToEvaluate);
+    }
+
+
+    public T getMostCommonFromMerge(T[] arrayToMerge) {
+        ArrayUtility newArr = new ArrayUtility(merge(arrayToMerge));
+        int count = 0;
+        T mostCommon = null;
+        for (Object el : newArr.list){
+            if (getNumberOfOccurrences((T)el) > count){
+                count = getNumberOfOccurrences((T)el);
+                mostCommon=(T)el;
+            }
+        }
+        return mostCommon;
+    }
+
+    public T[] removeValue(T valueToRemove) {
+    ArrayList<T> newArr = new ArrayList<>();//[list.length - getNumberOfOccurrences(valueToRemove)];
+        for (int i = 0; i < list.length; i++) {
+            if (!list[i].equals(valueToRemove)){
+                newArr.add(list[i]);
+            }
+        }
+        int newLength = newArr.size();
+        list = (T[]) Array.newInstance(list.getClass().getComponentType(), newLength);
+
+        return newArr.toArray(list);
+    }
 }

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

@@ -1,8 +1,6 @@
 package com.zipcodewilmington.arrayutility;
-
 import org.junit.Assert;
 import org.junit.Test;
-
 /**
  * Created by leon on 3/1/18.
  * The purpose of this class is to thoroughly test the method countDuplicatesInMerge()

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

@@ -1,5 +1,4 @@
 package com.zipcodewilmington.arrayutility;
-
 import org.junit.Assert;
 import org.junit.Test;
 

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

@@ -1,5 +1,4 @@
 package com.zipcodewilmington.arrayutility;
-
 import org.junit.Assert;
 import org.junit.Test;
 

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

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