done

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

@@ -1,7 +1,91 @@
 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<shivam> {
+
+    private shivam[] inputArray;
+
+    public ArrayUtility(shivam[] inputArray) {
+
+        this.inputArray = inputArray;
+
+    }
+
+    public shivam[] merge(shivam[] inputArray, shivam[] arrayToMerge) {
+        shivam[] newArr = (shivam[]) new Object[arrayToMerge.length + inputArray.length];
+        System.arraycopy(inputArray, 0, newArr, 0, inputArray.length);
+        System.arraycopy(arrayToMerge, 0, newArr, inputArray.length, arrayToMerge.length);
+
+        return newArr;
+    }
+
+    public Integer countDuplicatesInMerge(shivam[] arrayToMerge, shivam valueToEvaluate) {
+        int count = 0;
+        shivam[] newArr = merge(arrayToMerge, inputArray);
+
+        for (shivam s : newArr) {
+            if (s.equals(valueToEvaluate)) {
+
+                count++;
+            }
+
+        }
+        return count;
+    }
+
+    public shivam getMostCommonFromMerge(shivam[] arrayToMerge) {
+        shivam[] newArr = merge(inputArray, arrayToMerge);
+        shivam common = newArr[0];
+        int count = 1;
+        shivam temp;
+        int tempCount = 0;
+
+        for (int i = 0; i < (newArr.length - 1); i++) {
+            temp = newArr[i];
+
+            for (int j = 1; j < newArr.length; j++) {
+                if (temp == newArr[j])
+                    tempCount++;
+            }
+            if (tempCount > count) {
+                common = temp;
+                count = tempCount;
+            }
+        }
+
+        return common;
+    }
+
+    public Integer getNumberOfOccurrences(shivam valueToEvaluate) {
+        int count = 0;
+
+        for (shivam s : inputArray) {
+            if (s.equals(valueToEvaluate)) {
+                count++;
+
+            }
+        }
+
+        return count;
+    }
+
+    public shivam[] removeValue(shivam valueToRemove) {
+        Integer removed = getNumberOfOccurrences(valueToRemove);
+        shivam[] array = (shivam[]) Array.newInstance(inputArray.getClass().getComponentType(), inputArray.length-removed);
+        int count = 0;
+        for (int i = 0; i < inputArray.length; i++) {
+            if (!inputArray[i].equals(valueToRemove)) {
+                array[count] = inputArray[i];
+                count++;
+
+            }
+
+        }
+        return array;
+    }
 }

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

@@ -3,10 +3,11 @@ 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 getMostCommonFromMerge()
- */
+//*
+ //* Created by leon on 3/1/18.
+ //* The purpose of this class is to thoroughly test the method getMostCommonFromMerge()
+
+
 public class GetMostCommonFromMergeTest {
     @Test
     public void integerTest() {

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

@@ -3,10 +3,11 @@ 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 getNumberOfOccurrences()
- */
+//*
+ //* Created by leon on 3/1/18.
+ //* The purpose of this class is to thoroughly test the method getNumberOfOccurrences()
+
+
 public class GetNumberOfOccurrencesTest {
     @Test
     public void integerTest() {

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

@@ -1,12 +1,9 @@
 package com.zipcodewilmington.arrayutility;
 
-import com.zipcodewilmington.UnitTestingUtils;
 import org.junit.Test;
 
-/**
- * Created by leon on 3/1/18.
- * The purpose of this class is to thoroughly test the method removeValue()
- */
+
+
 public class RemoveValueTest {
     @Test
     public void integerTest() {