most common test

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

@@ -2,6 +2,8 @@ package com.zipcodewilmington.arrayutility;
 
 import java.lang.reflect.Array;
 import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.Map;
 
 /**
  * Created by leon on 3/6/18.
@@ -16,12 +18,34 @@ public class ArrayUtility<T> {
 
     public Integer countDuplicatesInMerge(T[] arrayToMerge, T valueToEvaluate) {
 
+
         return null;
     }
 
     public T getMostCommonFromMerge(T[] arrayToMerge) {
 
-        return null;
+        T mostCommon = null;
+        Integer highValue = 0;
+        Map<T, Integer> counts = new HashMap<>();
+
+        for (T data: array) {
+            if(counts.containsKey(data)) {
+                int currentAmount = counts.get(data);
+                currentAmount++;
+                counts.put(data, currentAmount);
+            } else {
+                counts.put(data, 1);
+            }
+        }
+
+        for (T key: counts.keySet()) {
+            if(counts.get(key) > highValue) {
+                highValue = counts.get(key);
+                mostCommon = key;
+            }
+        }
+
+        return mostCommon;
     }
 
     public Integer getNumberOfOccurrences(T valueToEvaluate) {