src/main/java/com/zipcodewilmington/looplabs/DuplicateDeleter.java

@@ -6,7 +6,8 @@ package com.zipcodewilmington.looplabs;
 public abstract class DuplicateDeleter<T> implements DuplicateDeleterInterface<T> {
     protected T[] array;
 
-    public DuplicateDeleter(T[] intArray) {
+    public DuplicateDeleter(T[] intArray)
+    {
         this.array = intArray;
     }
 

src/main/java/com/zipcodewilmington/looplabs/IntegerDuplicateDeleter.java

@@ -1,8 +1,121 @@
 package com.zipcodewilmington.looplabs;
 
+import java.util.*;
+
 /**
  * Created by leon on 1/29/18.
  * @ATTENTION_TO_STUDENTS You are forbidden from modifying the signature of this class.
  */
 public final class IntegerDuplicateDeleter extends DuplicateDeleter<Integer> {
+    ArrayList<Integer> list = new ArrayList<Integer>();
+
+    public IntegerDuplicateDeleter(Integer[] intArray) {
+        super(intArray);
+    }
+
+    @Override
+    public Integer[] removeDuplicates(int maxNumberOfDuplications) {
+        Arrays.sort (array);
+        int n = array.length;
+        int count = 0;
+        int num=0;
+        ArrayList<Integer>arraylist=new ArrayList<>() ;
+        //Get all unique values
+        HashSet set = new HashSet();
+        for (int i=0; i < array.length;i++) {
+            set.add(new Integer(array[i]));
+        }
+
+        Map<Integer,Integer> map=new HashMap<>();
+        Iterator it = set.iterator();
+        // Loop through the set for duplicates count and add it to Map
+        Integer temp;
+        while (it.hasNext()) {
+            //initialize the counter to 0
+            count = 0;
+            temp = (Integer) it.next();
+
+            //loop through the array sorted to count the duplicates
+
+            for (int j = 0; j < n; j++) {
+
+                if (temp.intValue() == array[j]) {
+
+                    count++;
+
+
+                }
+
+            }
+
+            map.put(temp, count);
+        }
+
+        for(Map.Entry<Integer,Integer>entry: map.entrySet()){
+            if(entry.getValue().intValue() < maxNumberOfDuplications ){
+                for (int i=0;  i< entry.getValue().intValue(); i++)
+                    arraylist.add(entry.getKey() );
+
+            }
+
+        }
+        Integer[] integers =arraylist.toArray(new  Integer[arraylist.size() ] ) ;     //return new Integer[0];
+
+        return  integers ;
+
+
+    }
+
+    @Override
+    public Integer[] removeDuplicatesExactly(int exactNumberOfDuplications) {
+        Arrays.sort (array);
+        int n = array.length;
+        int count = 0;
+        int num=0;
+        ArrayList<Integer>arraylist=new ArrayList<>() ;
+        //Get all unique values
+        HashSet set = new HashSet();
+        for (int i=0; i < array.length;i++) {
+            set.add(new Integer(array[i]));
+        }
+
+        Map<Integer,Integer>map=new HashMap<>();
+        Iterator it = set.iterator();
+        // Loop through the set for duplicates count and add it to Map
+        Integer temp;
+        while (it.hasNext()) {
+            //initialize the counter to 0
+            count = 0;
+            temp = (Integer) it.next();
+
+            //loop through the array sorted to count the duplicates
+
+            for (int j = 0; j < n; j++) {
+
+                if (temp.intValue() == array[j]) {
+
+                    count++;
+
+
+                }
+
+            }
+
+            map.put(temp, count);
+        }
+
+        for(Map.Entry<Integer,Integer>entry: map.entrySet()){
+            if(entry.getValue().intValue() != exactNumberOfDuplications){
+                for (int i=0;  i< entry.getValue().intValue(); i++)
+                    arraylist.add(entry.getKey() );
+
+            }
+
+        }
+        Integer[] integers =arraylist.toArray(new  Integer[arraylist.size() ] ) ;     //return new Integer[0];
+
+        return  integers ;
+    }
+
+
 }

src/main/java/com/zipcodewilmington/looplabs/StringDuplicateDeleter.java

@@ -1,8 +1,98 @@
 package com.zipcodewilmington.looplabs;
 
+import java.util.*;
+
 /**
  * Created by leon on 1/28/18.
  * @ATTENTION_TO_STUDENTS You are forbidden from modifying the signature of this class.
  */
-public final class StringDuplicateDeleter extends DuplicateDeleter<String> {
+public final class StringDuplicateDeleter extends DuplicateDeleter<String>
+{
+    public StringDuplicateDeleter(String[] intArray) {
+        super(intArray);
+    }
+
+    @Override
+    public String[] removeDuplicates(int maxNumberOfDuplications) {
+        Arrays.sort(array);
+        int n = array.length;
+        int count;
+        ArrayList<String>list=new ArrayList<>() ;
+        Map<String,Integer > map=new HashMap<>();
+        Set<String> set = new HashSet<String>();
+        for (int i = 0; i < n; i++) {
+            set.add(array[i]);
+        }
+        Iterator<String> itr = set.iterator();
+        String temp;
+        while (itr.hasNext()) {
+            count = 0;
+            temp =  itr.next();
+            for (int j = 0; j < n; j++) {
+
+                if (temp == array[j]) {
+
+                    count++;
+                }
+
+
+            }
+            map.put(temp,count);
+
+        }
+        for(Map.Entry<String,Integer>entry :map.entrySet() ){
+            if(entry.getValue().intValue()<maxNumberOfDuplications){
+                // for (int i=0;  i< entry.getValue().intValue(); i++)
+                list.add(entry.getKey() );
+
+
+            }
+        }
+        String[] str=list.toArray(new String[list.size() ]);
+
+
+        return str;
+    }
+
+    @Override
+    public String[] removeDuplicatesExactly(int exactNumberOfDuplications) {
+
+        Arrays.sort(array);
+        int n = array.length;
+        int count;
+        ArrayList<String> list=new ArrayList<>() ;
+        Map<String,Integer > map=new HashMap<>();
+        Set<String> set = new HashSet<String>();
+        for (int i = 0; i < n; i++) {
+            set.add(array[i]);
+        }
+        Iterator<String> itr = set.iterator();
+        String temp;
+        while (itr.hasNext()) {
+            count = 0;
+            temp =  itr.next();
+            for (int j = 0; j < n; j++) {
+
+                if (temp == array[j]) {
+
+                    count++;
+                }
+
+
+            }
+            map.put(temp,count);
+
+        }
+        for(Map.Entry<String,Integer>entry :map.entrySet() ){
+            if(entry.getValue().intValue() != exactNumberOfDuplications){
+                for (int i=0;  i< entry.getValue().intValue(); i++)
+                    list.add(entry.getKey() );
+
+
+            }
+        }
+        String[] str=list.toArray(new String[list.size() ]);
+
+        return str;
+    }
 }

src/test/java/com/zipcodewilmington/looplabs/IntegerDuplicateDeleterTest.java

@@ -57,32 +57,6 @@ public class IntegerDuplicateDeleterTest {
         TestUtils.assertArrayEquality(expected, actual);
     }
 
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
     @Test
     public void testRemoveDuplicates0() {
         Integer[] array = new Integer[]{0, 0, 0, 1, 1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5};