Merge 8eccf7bc519e92298480e3707505fd86034957bc into 5706be95854cd14023a646b5a08307e1b69df29c

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

@@ -1,7 +1,78 @@
 package com.zipcodewilmington.arrayutility;
 
+import java.util.*;
+
 /**
  * Created by leon on 3/6/18.
  */
-public class ArrayUtility {
+public class ArrayUtility<E> {
+
+    private E[] inputArray;
+
+    public ArrayUtility(E[] inputArray) {
+        this.inputArray = inputArray;
+    }
+
+    public int countDuplicatesInMerge(E[] arrayToMerge, E valueToEvaluate) {
+        int count = 0;
+        E[] finalArray = mergeArrays(arrayToMerge);
+        for (E element : finalArray) {
+            if (element.equals(valueToEvaluate)) {
+                count++;
+            }
+        }
+        return count;
+    }
+
+    public E[] mergeArrays(E[] arrayToMerge) {
+        ArrayList<E> arrayList = new ArrayList<>();
+        arrayList.addAll(Arrays.asList(inputArray));
+        arrayList.addAll(Arrays.asList(arrayToMerge));
+        return (E[]) arrayList.toArray();
+    }
+
+    public int getNumberOfOccurrences(E valueToEvaluate) {
+        int count = 0;
+        for (E element : inputArray) {
+            if (element == valueToEvaluate) {
+                count++;
+            }
+        }
+        return count;
+    }
+
+    public E getMostCommonFromMerge(E[] arrayToMerge) {
+        E[] finalArray = this.mergeArrays(arrayToMerge);
+        this.inputArray = finalArray;
+
+        Map<E, Integer> hashMap = new HashMap<>();
+        for (E key : this.inputArray) {
+            if (hashMap.get(key) == null) {
+                hashMap.put(key, getNumberOfOccurrences(key));
+            }
+        }
+        int maxNumberOfOccurrences = Collections.max(hashMap.values());
+
+        E mostCommon = null;
+        for (Map.Entry<E, Integer> entry : hashMap.entrySet()) {
+            if (entry.getValue() == maxNumberOfOccurrences) {
+                mostCommon = entry.getKey();
+            }
+        }
+        return mostCommon;
+    }
+
+    public E[] removeValue(E valueToRemove) {
+        int x = this.getNumberOfOccurrences(valueToRemove);
+        E[] reducedLengthArray = Arrays.copyOf(this.inputArray, this.inputArray.length - x);
+        for (int i = 0, j = 0; i < this.inputArray.length; i++) {
+            if (this.inputArray[i] != valueToRemove) {
+                reducedLengthArray[j] = this.inputArray[i];
+                j++;
+            }
+        }
+        return reducedLengthArray;
+    }
+
+
 }

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