Quiz 2

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;
+        }
+        return false;
     }
 
     public Boolean isLessThan7(Integer value) {
-        return null;
+        if (value <= 7) {
+            return true;
+        }
+        return false;
     }
 
     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;
+        char[] ch = string.toCharArray();
+            if (ch[0] == character || ch[0] == character.toUpperCase(character)) {
+                return true;
+            }
+        return false;
     }
 }
+

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

@@ -1,19 +1,39 @@
 package com.zipcodewilmington.assessment2.part1;
 
+import java.util.ArrayList;
+import java.util.List;
+
 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;
+
+        List<Integer> result = new ArrayList<>();
+        for (int i = start; i <= stop; i++)
+        {
+            result.add(i);
+        }
+
+        Integer[] finalResult = new Integer[result.size()];
+        for (int i =0; i < result.size(); i++) {
+            finalResult[i] = result.get(i);
+        }
+        return finalResult;
+
     }
 
     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,14 @@
 package com.zipcodewilmington.assessment2.part1;
 
 public class WuTangConcatenator {
+    private Integer input;
     public WuTangConcatenator(Integer input) {
+        this.input = input;
     }
+        public Boolean isWu () { return input % 3 == 0;}
 
-    public Boolean isWu() {
-        return null;
-    }
-
-    public Boolean isTang() {
-        return null;
-    }
+        public Boolean isTang () { return input % 5 == 0;}
 
-    public Boolean isWuTang() {
-        return null;
-    }
+        public Boolean isWuTang () { return input % 15 ==0;}
 }
+

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

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

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

@@ -1,29 +1,51 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import java.util.ArrayList;
 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;
     }
 
     public String join() {
-        return null;
+        String result = "";
+        for (int i = 0; i < list.size(); i++) {
+
+            if (i == list.size() - 1)
+                result += list.get(i).toString();
+            else
+                result += list.get(i).toString() + ", ";
+        }
+        return result;
     }
 
     public Integer mostCommon() {
+
+//        Integer result = list.get(0);
+//
+////        Integer [] common = new Integer[list.size()];
+////        for (int i = 0; i < list.size(); i++) {
+////            common[i] = list.get(i);
+////        }
+////         result = ArrayUtility.mostCommon(common);
+//
+//        return result;
+
         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,31 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import java.util.HashMap;
+import java.util.Map;
+
 public class Router {
-    public void add(String path, String controller) {
-    }
+
+    public Map<String,String> mymap = new HashMap<>();
+
+    public void add(String path, String controller) { this.mymap.put(path,controller); }
 
     public Integer size() {
-        return null;
+        return this.mymap.size();
     }
 
     public String getController(String path) {
-        return null;
+        return this.mymap.get(path);
     }
 
-    public void update(String path, String studentController) {
-    }
+    public void update(String path, String studentController) { this.mymap.put(path,studentController);}
 
-    public void remove(String path) {
-    }
+    public void remove(String path) { this.mymap.remove(path); }
+
+//    @Override
+//    public String toString() {
+//        return "Router{" +
+//                "mymap=" + mymap +
+//                '}';
+//    }
 }
+

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

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

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

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

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{
+    String move;
+    String color;
+
+    public Horse() {
+        this.move="gallop";
+        this.color="brown";
+    }
+
+    @Override
+    public String move() { return move; }
+
+    @Override
+    public String color() { return color; }
+
+    @Override
+    public int getSpeed() { return 20; }
 }

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

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

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> {
+
+    @Override
+    public int compare(Animal o1, Animal o2) { return o2.getSpeed()-o1.getSpeed(); }
 }