Submitting

src/main/java/com/zipcodewilmington/assessment2/part1/BasicUtilities.java

@@ -2,18 +2,32 @@
 
 public class BasicUtilities {
     public Boolean isGreaterThan5(Integer value) {
-        return null;
+        if (value >= 5)
+            return true;
+        else
+            return false;
     }
 
     public Boolean isLessThan7(Integer value) {
-        return null;
+        if (value <= 7)
+            return true;
+        else
+            return false;
     }
 
     public Boolean isBetween5And7(Integer valueToEvaluate) {
-        return null;
+        if (isGreaterThan5(valueToEvaluate) && isLessThan7(valueToEvaluate)) {
+            return true;
+        }
+        return false;
     }
 
     public Boolean startsWith(String string, Character character) {
-        return null;
+        if (string.toLowerCase().charAt(0) == character)
+            return true;
+        else if (string.charAt(0) == character)
+            return true;
+        else
+            return false;
     }
 }

src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java

@@ -1,19 +1,32 @@
 package com.zipcodewilmington.assessment2.part1;
 
+import java.util.ArrayList;
+
 public class IntegerArrayUtilities {
     public Boolean hasEvenLength(Integer[] array) {
-        return null;
+        if (array.length % 2 == 0)
+            return true;
+        else
+            return false;
     }
 
     public Integer[] range(int start, int stop) {
-        return null;
+        ArrayList<Integer> list = new ArrayList<>();
+        for (int i = start; i <= stop; i++) {
+            list.add(i);
+        }
+
+        Integer[] newArr = list.toArray(new Integer[0]);
+        return newArr;
     }
 
     public Integer getSumOfFirstTwo(Integer[] array) {
-        return null;
+        Integer sum = array[0] + array[1];
+        return sum;
     }
 
     public Integer getProductOfFirstTwo(Integer[] array) {
-        return null;
+        Integer product = array[array.length-1] * array[array.length-2];
+        return product;
     }
 }

src/main/java/com/zipcodewilmington/assessment2/part1/WuTangConcatenator.java

@@ -1,18 +1,29 @@
 package com.zipcodewilmington.assessment2.part1;
 
 public class WuTangConcatenator {
+    Integer input = 0;
     public WuTangConcatenator(Integer input) {
+    this.input = input;
     }
 
     public Boolean isWu() {
-        return null;
+        if (input % 3 == 0)
+            return true;
+        else
+            return false;
     }
 
     public Boolean isTang() {
-        return null;
+        if (input % 5 == 0)
+            return true;
+        else
+            return false;
     }
 
     public Boolean isWuTang() {
-        return null;
+        if (input % 3 == 0 && input % 5 == 0)
+            return true;
+        else
+            return false;
     }
 }

src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java

@@ -1,19 +1,79 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
 public class ArrayUtility {
     public Integer[] merge(Integer[] array1, Integer[] array2) {
-        return null;
+        Integer[] newArr = new Integer[array1.length + array2.length];
+        int count = 0;
+
+        for (int i = 0; i < array1.length; i++) {
+            newArr[i] = array1[i];
+            count++;
+        }
+
+        for (int j = 0; j < array2.length; j++) {
+            newArr[count++] = array2[j];
+        }
+
+        return newArr;
     }
 
     public Integer[] rotate(Integer[] array, Integer index) {
-        return null;
+        for (int i = 0; i < index; i++) {
+            int j;
+            int first;
+            first = array[0];
+
+            for(j = 0; j < array.length -1; j++) {
+                array[j] = array[j+1];
+            }
+
+            array[j] = first;
+        }
+
+        return array;
     }
 
     public Integer countOccurrence(Integer[] array1, Integer[] array2, Integer valueToEvaluate) {
-        return null;
+        int count1 = 0;
+        int count2 = 0;
+        int total = 0;
+
+        for (int i = 0; i < array1.length; i++) {
+            if (array1[i] == valueToEvaluate)
+                count1++;
+        }
+
+        for (int j = 0; j < array2.length; j++) {
+            if (array2[j] == valueToEvaluate)
+                count2++;
+        }
+
+        total = count1 + count2;
+        return total;
+
     }
 
     public Integer mostCommon(Integer[] array) {
-        return null;
+        int count = 1;
+        int tempCount;
+        int popular = array[0];
+        int temp = 0;
+        for (int i = 0; i < (array.length - 1); i++) {
+            temp = array[i];
+            tempCount = 0;
+            for (int j = 1; j < array.length; j++) {
+                if (temp == array[j])
+                    tempCount++;
+            }
+            if (tempCount > count) {
+                popular = temp;
+                count = tempCount;
+            }
+        }
+        return popular;
     }
 }

src/main/java/com/zipcodewilmington/assessment2/part2/ListUtility.java

@@ -1,29 +1,40 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import java.util.ArrayList;
+import java.util.LinkedHashSet;
 import java.util.List;
 
 public class ListUtility {
+
+    List<Integer> list = new ArrayList<>();
+
     public Boolean add(int i) {
-        return null;
+       return list.add(i);
     }
 
     public Integer size() {
-        return null;
+        return list.size();
     }
 
     public List<Integer> getUnique() {
-        return null;
+        return new ArrayList<>(new LinkedHashSet<>(list));
     }
 
     public String join() {
-        return null;
+        String result = "" + list.get(0);
+        for (int i = 1; i<list.size(); i++) {
+            result += ", " + list.get(i);
+        }
+
+        return result;
     }
 
     public Integer mostCommon() {
         return null;
     }
 
     public Boolean contains(Integer valueToAdd) {
-        return null;
+
+        return list.contains(valueToAdd);
     }
 }

src/main/java/com/zipcodewilmington/assessment2/part2/Router.java

@@ -1,20 +1,28 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import java.util.HashMap;
+
 public class Router {
+    HashMap<String, String> map = new HashMap<>();
+
     public void add(String path, String controller) {
+        map.put(path, controller);
     }
 
     public Integer size() {
-        return null;
+
+        return map.size();
     }
 
     public String getController(String path) {
         return null;
     }
 
     public void update(String path, String studentController) {
+        map.replace(path, studentController);
     }
 
     public void remove(String path) {
+        map.remove(path);
     }
 }

src/main/java/com/zipcodewilmington/assessment2/part3/Bird.java

@@ -1,8 +1,8 @@
 package com.zipcodewilmington.assessment2.part3;
 
-public class Bird {
+public abstract class Bird implements Animal{
     public String move() {
-        return null;
+        return "fly";
     }
 
     public void setMigrationMonth(String expected) {

src/main/java/com/zipcodewilmington/assessment2/part3/BlueJay.java

@@ -1,4 +1,13 @@
 package com.zipcodewilmington.assessment2.part3;
 
-public class BlueJay {
+public class BlueJay extends Bird {
+
+    public String color() {
+        return "blue";
+    }
+
+    @Override
+    public int getSpeed() {
+        return 13;
+    }
 }

src/main/java/com/zipcodewilmington/assessment2/part3/Horse.java

@@ -1,4 +1,18 @@
 package com.zipcodewilmington.assessment2.part3;
 
-public class Horse{
+public class Horse implements Animal {
+    @Override
+    public String move() {
+        return "gallop";
+    }
+
+    @Override
+    public int getSpeed() {
+        return 40;
+    }
+
+    @Override
+    public String color() {
+        return "brown";
+    }
 }

src/main/java/com/zipcodewilmington/assessment2/part3/RedRobin.java

@@ -1,4 +1,25 @@
 package com.zipcodewilmington.assessment2.part3;
 
-public class RedRobin {
+public class RedRobin extends Bird {
+    @Override
+    public String getMigrationMonth() {
+        return migrationMonth;
+    }
+
+    @Override
+    public void setMigrationMonth(String migrationMonth) {
+        this.migrationMonth = migrationMonth;
+    }
+
+    private String migrationMonth;
+
+    @Override
+    public int getSpeed() {
+        return 10;
+    }
+
+    @Override
+    public String color() {
+        return "red";
+    }
 }

src/main/java/com/zipcodewilmington/assessment2/part3/SpeedComparator.java

@@ -1,4 +1,9 @@
 package com.zipcodewilmington.assessment2.part3;
 
-public class SpeedComparator {
+import java.util.Comparator;
+
+public class SpeedComparator implements Comparator<Animal> {
+    public int compare(Animal a, Animal b){
+        return b.getSpeed() - a.getSpeed();
+    }
 }