quiz 2

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

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

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

@@ -1,19 +1,31 @@
 package com.zipcodewilmington.assessment2.part1;
 
+import java.util.ArrayList;
+import java.util.List;
+
 public class IntegerArrayUtilities {
     public Boolean hasEvenLength(Integer[] array) {
-        return null;
+
+        return array.length%2==0;
     }
 
     public Integer[] range(int start, int stop) {
-        return null;
+        List<Integer> list= new ArrayList<>();
+        for (int i = start; i < stop+1; i++) {
+            list.add(i);
+        }
+        Integer[] result = new Integer[list.size()];
+        result = list.toArray(result);
+        return result;
     }
 
     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,23 @@
 package com.zipcodewilmington.assessment2.part1;
 
 public class WuTangConcatenator {
+    public Integer input;
     public WuTangConcatenator(Integer input) {
+        this.input = input;
     }
 
     public Boolean isWu() {
-        return null;
+
+        return input%3==0;
     }
 
     public Boolean isTang() {
-        return null;
+
+        return input%5==0;
     }
 
     public Boolean isWuTang() {
-        return null;
+
+        return isWu()&&isTang();
     }
 }

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

@@ -1,19 +1,70 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import com.j256.ormlite.stmt.query.In;
+
+import java.util.*;
+
 public class ArrayUtility {
     public Integer[] merge(Integer[] array1, Integer[] array2) {
-        return null;
+        List arr1 = new ArrayList(Arrays.asList(array1));
+        arr1.addAll(Arrays.asList(array2));
+        Integer[] result = new Integer[arr1.size()];
+        result = (Integer[]) arr1.toArray(result);
+        return result;
     }
 
     public Integer[] rotate(Integer[] array, Integer index) {
-        return null;
+
+        for (int i = 0; i < index; i++) {
+            int j;
+            int 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;
+        ArrayUtility au = new ArrayUtility();
+        int count = 0;
+        List<Integer> list = Arrays.asList(au.merge(array1, array2));
+        for(Integer i : list){
+            if(i==valueToEvaluate){
+                count++;
+            }
+        }
+        return count;
     }
 
     public Integer mostCommon(Integer[] array) {
-        return null;
+
+        Map<Integer,Integer> map = new HashMap<>();
+        Integer highestValue = Integer.MIN_VALUE;
+        Integer highestKey = 0;
+        for(Integer i : array){
+            if(array.length == 1){
+                return array[0];
+            }
+            Integer v = map.get(i);
+            if(!map.containsKey(i) && i!=null){
+                map.put(i,1);
+            }
+            else{
+                if(i!=null){
+                    map.replace(i,v+1);
+                }
+
+                if(v>highestValue){
+                    highestValue = v;
+                    highestKey = i;
+                }
+            }
+
+
+        }
+
+        return highestKey;
     }
 }

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

@@ -1,29 +1,68 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import java.util.ArrayList;
 import java.util.List;
 
-public class ListUtility {
-    public Boolean add(int i) {
-        return null;
+public class ListUtility  {
+
+   public List<Integer> list;
+
+   public ListUtility(){
+       list = new ArrayList<>();
+   }
+
+    public Boolean add(Integer i) {
+        list.add(i);
+        return list.contains(i);
     }
 
     public Integer size() {
-        return null;
+
+       return list.size();
     }
 
     public List<Integer> getUnique() {
-        return null;
+       List<Integer> result = new ArrayList<>();
+        for(Integer i : list){
+            if(!result.contains(i)){
+                result.add(i);
+            }
+        }
+       return result;
     }
 
     public String join() {
-        return null;
+       String s = "";
+
+        for(Integer i : list){
+            if(list.size()==1){
+                return i.toString();
+            }
+            else{
+
+                s+=i+", ";
+            }
+
+        }
+        s=s.substring(0,s.length()-2);
+       return s;
     }
 
     public Integer mostCommon() {
-        return null;
+        ArrayUtility au = new ArrayUtility();
+        Integer[] result = new Integer[list.size()];
+        result = list.toArray(result);
+        Integer mc = au.mostCommon(result);
+
+       return mc;
+
     }
 
     public Boolean contains(Integer valueToAdd) {
-        return null;
+
+       return list.contains(valueToAdd);
     }
+
+
+
 }

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

@@ -1,20 +1,42 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import java.util.HashMap;
+import java.util.Map;
+
 public class Router {
+    public Map<String,String> map;
+
+    public Router(){
+        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;
+
+        return map.get(path);
     }
 
     public void update(String path, String studentController) {
+        map.replace(path, studentController);
     }
 
     public void remove(String path) {
+        map.remove(path);
+    }
+
+    @Override
+    public String toString() {
+       StringBuilder mapString = new StringBuilder();
+       for (String key: map.keySet()){
+           mapString.append(key + " -> "+ map.get(key) +"\n");
+       }
+       return mapString.toString();
     }
 }

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 {
+    @Override
+    public int getSpeed() {
+        return 13;
+    }
+
+    @Override
+    public String color() {
+        return "blue";
+    }
 }

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 {
+    private String migrationMonth;
+
+
+
+    public void setMigrationMonth(String month){
+        this.migrationMonth = month;
+    }
+
+    public String getMigrationMonth(){
+        return 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,18 @@
 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;
+        }
+        else if(o1.getSpeed() > o2.getSpeed()){
+            return -1;
+        }
+        else{
+            return 1;
+        }
+    }
 }