Test donnish

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

@@ -2,18 +2,26 @@
 
 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;
+        if(valueToEvaluate >=5 && valueToEvaluate<= 7){
+            return true;
+
+        }        return false;
     }
 
     public Boolean startsWith(String string, Character character) {
-        return null;
+        Character chare = Character.toUpperCase(character);
+        if (string.charAt(0) == chare){
+            return true;
+
+        }        return false;
     }
 }

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

@@ -2,18 +2,27 @@
 
 public class IntegerArrayUtilities {
     public Boolean hasEvenLength(Integer[] array) {
-        return null;
+        if(array.length%2 == 0){
+            return true;
+
+        }        return false;
     }
 
     public Integer[] range(int start, int stop) {
-        return null;
+        Integer[] answer = new Integer[stop-start+1];
+        for (int i = 0; i < answer.length ; i++) {
+            answer[i] = start+i;
+        }
+        return answer;
     }
 
     public Integer getSumOfFirstTwo(Integer[] array) {
-        return null;
+
+        return array[0]+array[1];
     }
 
     public Integer getProductOfFirstTwo(Integer[] array) {
-        return null;
+
+        return array[array.length-1]*array[array.length-2];
     }
 }

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

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

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

@@ -1,19 +1,71 @@
 package com.zipcodewilmington.assessment2.part2;
 
+
+import java.util.Arrays;
+
 public class ArrayUtility {
     public Integer[] merge(Integer[] array1, Integer[] array2) {
-        return null;
+        Integer[] answer = new Integer[array1.length + array2.length];
+        int counter = 0;
+        for (int i = 0; i <array1.length ; i++) {
+            answer[i] = array1[i];
+            counter++;
+        }
+        for (int i = 0; i <array2.length ; i++) {
+            answer[counter] = array2[i];
+            counter++;
+        }
+        return answer;
     }
 
     public Integer[] rotate(Integer[] array, Integer index) {
-        return null;
+        Integer[] answer = new Integer[array.length];
+        Integer[] preFlip;
+        Integer[] postFlip;
+       preFlip =  Arrays.copyOfRange(array,0,index);
+       postFlip= Arrays.copyOfRange(array,index,array.length);
+
+        answer = merge(postFlip,preFlip);
+        return answer;
     }
 
     public Integer countOccurrence(Integer[] array1, Integer[] array2, Integer valueToEvaluate) {
-        return null;
+        int counter = 0;
+        for (int i = 0; i <array1.length ; i++) {
+            if(array1[i].equals(valueToEvaluate)){
+                counter++;
+            }
+
+        }
+        for (int i = 0; i <array2.length ; i++) {
+            if(array2[i].equals(valueToEvaluate)){
+                counter++;
+            }
+
+
+        }
+
+        return counter;
     }
 
     public Integer mostCommon(Integer[] array) {
-        return null;
+        Integer answer=-1;
+        Integer counter = 0;
+        Integer countAgainst =0;
+        for (int i = 0; i <array.length ; i++) {
+            for (int j = 0; j <array.length ; j++) {
+                if(array[i].equals(array[j])){
+                    counter++;
+                    if(counter>countAgainst){
+                        answer = array[j];
+                    }
+                }
+
+            }
+            counter=0;
+        }
+
+
+        return answer;
     }
 }

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

@@ -1,29 +1,67 @@
 package com.zipcodewilmington.assessment2.part2;
 
-import java.util.List;
 
+import java.util.ArrayList;
+import java.util.HashSet;
+import java.util.List;
 public class ListUtility {
-    public Boolean add(int i) {
-        return null;
+    ArrayList<Integer> testList = new ArrayList<>();
+
+    public Boolean add(Integer i) {
+        Integer j = i;
+        testList.add(j);
+        return testList.contains(j);
     }
 
     public Integer size() {
-        return null;
+        return testList.size();
     }
 
     public List<Integer> getUnique() {
-        return null;
+        HashSet<Integer> test = new HashSet<>(this.testList);
+        ArrayList<Integer> answer = new ArrayList<>(test);
+        return answer;
     }
 
     public String join() {
-        return null;
+        String answer ="";
+        for (int i = 0; i <testList.size()-1 ; i++) {
+            answer+= testList.get(i) + ", ";
+        }
+        answer+= testList.get(testList.size()-1);
+
+        return answer;
     }
 
     public Integer mostCommon() {
-        return null;
+        Integer answer=-1;
+        Integer counter = 0;
+        Integer countAgainst =0;
+
+        for (int i = 0; i <testList.size() ; i++) {
+            for (int j = 0; j <testList.size() ; j++) {
+                if(testList.get(i).equals(testList.get(j))){
+                    counter++;
+                    if(counter>countAgainst){
+                        countAgainst=counter;
+                        answer = testList.get(j);
+                    }
+                }
+
+            }
+            counter=0;
+        }
+
+
+        return answer;
     }
 
     public Boolean contains(Integer valueToAdd) {
-        return null;
+
+            if (testList.contains(valueToAdd)) {
+                return true;
+            }
+
+        return false;
     }
 }

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

@@ -1,20 +1,32 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import java.util.Hashtable;
+
 public class Router {
+    Hashtable<String,String> test = new Hashtable<>();
     public void add(String path, String controller) {
+        test.put(path,controller);
     }
 
     public Integer size() {
-        return null;
+        return test.size();
     }
 
     public String getController(String path) {
-        return null;
+
+        return test.get(path);
     }
 
     public void update(String path, String studentController) {
+        test.replace(path,studentController);
     }
 
     public void remove(String path) {
+        test.remove(path);
+    }
+
+    @Override
+    public String toString() {
+        return ""+ test.keySet() ;
     }
 }

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

@@ -1,7 +1,17 @@
 package com.zipcodewilmington.assessment2.part3;
 
-public class Bird {
+public class Bird implements Animal{
     public String move() {
+        return "fly";
+    }
+
+    @Override
+    public int getSpeed() {
+        return 0;
+    }
+
+    @Override
+    public String color() {
         return null;
     }
 

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

@@ -1,4 +1,14 @@
 package com.zipcodewilmington.assessment2.part3;
 
-public class BlueJay {
+public class BlueJay extends Bird {
+    @Override
+    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{
+String migrationMonth;
+
+    public void setMigrationMonth(String month){
+        this.migrationMonth=month;
+    }
+
+    public String getMigrationMonth(){
+        return this.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,16 @@
 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) {
+        if(o1.getSpeed() == o2.getSpeed()) {
+            return 0;
+        }
+        if(o1.getSpeed()> o2.getSpeed()){
+            return -1;
+        }
+        return 1;
+    }
 }

src/test/java/com/zipcodewilmington/assessment2/part2/router/ToStringTest.java

@@ -4,6 +4,7 @@
 import org.junit.Assert;
 import org.junit.Test;
 
+
 public class ToStringTest {
     @Test
     public void test1() {
@@ -36,7 +37,7 @@ public void test4() {
                 new Pair<>("/instructors", "InstructorController"));
     }
 
-    @Test
+
     public void test(Pair<String, String>... pairs) {
         // given
         StringBuilder expectedString = new StringBuilder();