Sandeep's Quiz 2

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

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

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

@@ -1,19 +1,28 @@
 package com.zipcodewilmington.assessment2.part1;
 
 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[] newArray = new Integer[stop - start + 1];
+        int idx = 0;
+        for (int i = stop; i >= start; i--){
+            newArray[idx] = i;
+            idx++;
+        }
+        return newArray;
     }
 
     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,22 @@
 package com.zipcodewilmington.assessment2.part1;
 
 public class WuTangConcatenator {
-    public WuTangConcatenator(Integer input) {
-    }
 
-    public Boolean isWu() {
-        return null;
-    }
+    Integer input;
 
-    public Boolean isTang() {
-        return null;
-    }
+        public WuTangConcatenator(Integer input) {
+            this.input = input;
+        }
 
-    public Boolean isWuTang() {
-        return null;
-    }
-}
+        public Boolean isWu() {
+            return input % 3 == 0;
+        }
+
+        public Boolean isTang() {
+            return input % 5 == 0;
+        }
+
+        public Boolean isWuTang() {
+            return isTang() && isWu();
+        }
+    }

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

@@ -1,19 +1,80 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import java.util.Map;
+import java.util.TreeMap;
+
 public class ArrayUtility {
     public Integer[] merge(Integer[] array1, Integer[] array2) {
-        return null;
+
+        Integer[] newArray = new Integer[array1.length + array2.length];
+        for (int i = 0; i < array1.length; i++) {
+            newArray[i] = array1[i];
+        }
+
+        for (int j = 0; j < array2.length; j++) newArray[j + array1.length] = array2[j];
+
+        return newArray;
     }
 
     public Integer[] rotate(Integer[] array, Integer index) {
-        return null;
+
+        Integer[] newArray = new Integer[array.length];
+        for (int i = 0; i < array.length; i++) {
+            if (i - index < 0) {
+                newArray[array.length - index + i] = array[i];
+            } else {
+                newArray[i - index] = array[i];
+            }
+        }
+        return newArray;
     }
 
     public Integer countOccurrence(Integer[] array1, Integer[] array2, Integer valueToEvaluate) {
-        return null;
+
+        int c = 0;
+        for(Integer i : array1){
+            if(i == valueToEvaluate){
+                c++;
+            }
+        }
+        for(Integer i : array2){
+            if(i == valueToEvaluate){
+                c++;
+            }
+        }
+        return c;
     }
 
-    public Integer mostCommon(Integer[] array) {
-        return null;
+    public static Integer mostCommon(Integer[] array) {
+
+        Map<Integer, Integer> c = new TreeMap<>();
+        int nc = 0;
+        for (int i = 0; i < array.length; i++) {
+            if (array[i] != null) {
+                Integer count = c.get(array[i]);
+                if (count == null) {
+                    c.put(array[i], 1);
+                } else {
+                    c.put(array[i], count++);
+                }
+            } else {
+                nc++;
+            }
+        }
+
+
+        Integer maxKey = null;
+        int maxValue = 0;
+
+        for (Map.Entry<Integer, Integer> e : c.entrySet()) {
+            if (e.getValue() >= maxValue) {
+                maxKey = e.getKey();
+                maxValue = e.getValue();
+            }
+        }
+        if (nc > maxValue) {
+            return null;
+        }
+        return maxKey;
     }
 }

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

@@ -1,26 +1,54 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import java.util.ArrayList;
 import java.util.List;
 
 public class ListUtility {
-    public Boolean add(int i) {
-        return null;
+
+    private List<Integer> list = new ArrayList<>();
+
+    public Boolean add(Integer i) {
+
+        if(i == null){
+            list.add(null);
+        }
+        list.add(i);
+        return list.contains(i);
     }
 
     public Integer size() {
-        return null;
+        return list.size();
     }
 
-    public List<Integer> getUnique() {
-        return null;
+    public List<Integer> getUnique(){
+
+        List<Integer> newList = new ArrayList<>();
+        for(Integer i : list){
+        if (!newList.contains(i)){
+            newList.add(i);
+        }
     }
+        return newList;
+}
 
     public String join() {
-        return null;
+
+        String c = list.get(0).toString();
+        if( list.size() ==1) {
+            return list.get(0).toString();
+        }
+        else
+        for (int i = 1; i < list.size(); i++){
+            c = c + ", " +list.get(i) ;
+    }
+        return c;
     }
 
     public Integer mostCommon() {
-        return null;
+
+        Integer[] array = new Integer[list.size()];
+        array = list.toArray(array);
+        return ArrayUtility.mostCommon(array);
     }
 
     public Boolean contains(Integer valueToAdd) {

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

@@ -1,20 +1,44 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import java.util.Map;
+import java.util.TreeMap;
+
 public class Router {
+
+    Map<String, String> map = new TreeMap<>();
+
     public void add(String path, String controller) {
+
+        map.put(path, controller);
     }
 
     public Integer size() {
-        return null;
+
+        return map.keySet().size();
     }
 
     public String getController(String path) {
-        return null;
+
+        return map.get(path);
     }
 
     public void update(String path, String studentController) {
+
+        add(path, studentController);
     }
 
     public void remove(String path) {
+
+        map.put(path, null);
+    }
+
+    public String toString() {
+
+        String s = "";
+
+        for (String path : map.keySet()) {
+            s = s + path + " -> " + map.get(path) + "\n";
+        }
+        return s;
     }
-}
+}

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

@@ -1,15 +1,24 @@
 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;
     }
 
     public void setMigrationMonth(String expected) {
 
     }
 
-    public String getMigrationMonth() {
-        return null;
-    }
+    public String getMigrationMonth() { return null; }
 }

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

@@ -1,4 +1,12 @@
 package com.zipcodewilmington.assessment2.part3;
 
-public class BlueJay {
+public class BlueJay extends Bird{
+
+    public String color() {
+        return "blue";
+    }
+
+    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{
+
+    private String migrationMonth;
+
+    public String color() {
+        return "red";
+    }
+
+    public int getSpeed() {
+        return 10;
+    }
+
+    public void setMigrationMonth(String expected) {
+
+        this.migrationMonth = expected;
+
+    }
+
+    public String getMigrationMonth() {
+
+        return this.migrationMonth;
+    }
 }

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

@@ -1,4 +1,12 @@
 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();
+        }
 }