my submission

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

@@ -2,18 +2,25 @@
 
 public class BasicUtilities {
     public Boolean isGreaterThan5(Integer value) {
-        return null;
+
+        return value >= 5;
     }
 
     public Boolean isLessThan7(Integer value) {
-        return null;
+
+        return value <= 7;
     }
 
     public Boolean isBetween5And7(Integer valueToEvaluate) {
-        return null;
+
+        return (valueToEvaluate >= 5 && valueToEvaluate <= 7);
     }
 
     public Boolean startsWith(String string, Character character) {
-        return null;
+        String[] newArray = string.split("");
+        String s = newArray[0];
+        char t = s.charAt(0);
+        char c = Character.toLowerCase(t);
+        return c == Character.toLowerCase(character);
     }
 }

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

@@ -2,18 +2,28 @@
 
 public class IntegerArrayUtilities {
     public Boolean hasEvenLength(Integer[] array) {
-        return null;
+
+        return array.length % 2 == 0;
     }
 
     public Integer[] range(int start, int stop) {
-        return null;
+        Integer arrayLength = stop - start + 1;
+        int count = start;
+        Integer[] newArray = new Integer[arrayLength];
+        for(int i = 0; i < newArray.length; i++){
+            newArray[i] = count;
+            count ++;
+        }
+        return newArray;
     }
 
     public Integer getSumOfFirstTwo(Integer[] array) {
-        return null;
+
+        return array[0] + array[1];
     }
 
     public Integer getProductOfFirstTwo(Integer[] array) {
-        return null;
+        int len = array.length;
+        return array[len-1]*array[len-2];
     }
 }

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

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

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

@@ -2,18 +2,67 @@
 
 public class ArrayUtility {
     public Integer[] merge(Integer[] array1, Integer[] array2) {
-        return null;
+        int len = array1.length + array2.length;
+        int counter = 0;
+        Integer[] newArray = new Integer[len];
+        for(int i = 0; i < array1.length; i++){
+            newArray[i] = array1[i];
+        }
+        for(int i = array1.length; i < newArray.length; i ++){
+            newArray[i] = array2[counter];
+            counter++;
+        }
+
+        return newArray;
     }
 
     public Integer[] rotate(Integer[] array, Integer index) {
-        return null;
+        int len = array.length;
+        Integer[] newArray = new Integer[len];
+        for(int i = 0; i < array.length; i++){
+            if(i == 0){
+                newArray[i] = array[i+1];
+            }
+
+        }
+
+        return newArray;
     }
 
     public Integer countOccurrence(Integer[] array1, Integer[] array2, Integer valueToEvaluate) {
-        return null;
+        int count = 0;
+        for(int i = 0; i < array1.length; i++){
+            if(array1[i] == valueToEvaluate){
+                count ++;
+            }
+        }
+        for(int i = 0; i < array2.length; i++){
+            if(array2[i] == valueToEvaluate){
+                count++;
+            }
+        }
+        return count;
     }
 
     public Integer mostCommon(Integer[] array) {
-        return null;
+        int count = 0;
+        int mostCommon = array[0];
+        int tempCount;
+        int temp = 0;
+        for(int i = 0; i < array.length; i++){
+            temp = array[i];
+            tempCount = 0;
+            for(int j = 1; j < array.length; j++){
+                if(array[0].equals(array[j])){
+                    count++;
+                }
+                if(tempCount > count){
+                    mostCommon = temp;
+                    count = tempCount;
+                }
+
+            }
+        }
+        return mostCommon;
     }
 }

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

@@ -1,18 +1,25 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import java.util.ArrayList;
+import java.util.HashSet;
 import java.util.List;
+import java.util.Set;
 
 public class ListUtility {
+    List list = new ArrayList();
     public Boolean add(int i) {
-        return null;
+        list.add(i);
+        return list.contains(i);
     }
 
     public Integer size() {
-        return null;
+
+        return this.list.size();
     }
 
     public List<Integer> getUnique() {
-        return null;
+        Set<Integer> uniqueList = new HashSet<Integer>(this.list);
+        return (List<Integer>)uniqueList;
     }
 
     public String join() {
@@ -24,6 +31,7 @@ public Integer mostCommon() {
     }
 
     public Boolean contains(Integer valueToAdd) {
-        return null;
+
+        return this.list.contains(valueToAdd);
     }
 }

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

@@ -1,10 +1,20 @@
 package com.zipcodewilmington.assessment2.part3;
 
-public class Bird {
+public class Bird implements Animal {
     public String move() {
         return null;
     }
 
+    @Override
+    public int getSpeed() {
+        return 0;
+    }
+
+    @Override
+    public String color() {
+        return null;
+    }
+
     public void setMigrationMonth(String expected) {
 
     }

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

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

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

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

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

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

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

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