updates

src/main/java/rocks/zipcode/quiz5/collections/Food.java

@@ -9,6 +9,7 @@ import java.util.Map;
  * @author leon on 27/12/2018.
  */
 public class Food {
+
     public List<Spice> getAllSpices() {
         return null;
     }

src/main/java/rocks/zipcode/quiz5/collections/WordCounter.java

@@ -1,12 +1,31 @@
 package rocks.zipcode.quiz5.collections;
 
+import java.util.HashMap;
 import java.util.Map;
 
 public class WordCounter {
+
+    String[] strings;
+
     public WordCounter(String... strings) {
+        this.strings = strings;
+    }
+
+    public Integer wordCount(String word){
+        Integer counter = 0;
+        for(String s: strings){
+            if(s.equals(word)){
+                counter++;
+            }
+        }
+        return counter;
     }
 
     public Map<String, Integer> getWordCountMap() {
-        return null;
+        Map<String, Integer> wordCountMap = new HashMap<>();
+        for (String s: strings) {
+            wordCountMap.put(s, this.wordCount(s));
+        }
+        return wordCountMap;
     }
 }

src/main/java/rocks/zipcode/quiz5/fundamentals/Calculator.java

@@ -5,31 +5,37 @@ package rocks.zipcode.quiz5.fundamentals;
  */
 public class Calculator {
     public static Double squareRoot(Double value) {
-        return null;
+        return Math.sqrt(value);
     }
 
     public static Double square(Double value) {
-        return null;
+        return value*value;
     }
 
     public static Double[] squareRoots(Double... value) {
-        return null;
+        for(int i = 0; i<value.length; i++){
+            value[i] = Math.sqrt(value[i]);
+        }
+        return value;
     }
 
     public static Double[] squares(Double... values) {
-        return null;
+        for(int i = 0; i<values.length; i++){
+            values[i] = values[i]*values[i];
+        }
+        return values;
     }
 
     public static Double add(Double value1, Double value2) {
-        return null;
+        return (Double) value1+value2;
     }
 
     public static Double subtract(Double value1, Double value2) {
-        return null;
+        return value1-value2;
     }
 
 
     public static Double divide(Double divisor, Double dividend) {
-        return null;
+        return divisor/dividend;
     }
 }

src/main/java/rocks/zipcode/quiz5/fundamentals/StringUtils.java

@@ -1,34 +1,68 @@
 package rocks.zipcode.quiz5.fundamentals;
 
+import java.util.ArrayList;
+import java.util.Arrays;
+
 /**
  * @author leon on 21/12/2018.
  */
 public class StringUtils {
     public static Character getMiddleCharacter(String string) {
-        return null;
+        return string.charAt(string.length()/2);
     }
 
     public static String capitalizeMiddleCharacter(String str) {
-        return null;
+        String capMiddle = "";
+        capMiddle = (str.substring(0, str.length()/2) + getMiddleCharacter(str).toString().toUpperCase() + str.substring(str.length()/2+1));
+        return capMiddle;
     }
 
     public static String lowerCaseMiddleCharacter(String str) {
-        return null;
+        String lowMiddle = "";
+        lowMiddle = (str.substring(0, str.length()/2) + getMiddleCharacter(str).toString().toLowerCase() + str.substring(str.length()/2+1));
+        return lowMiddle;
     }
 
     public static Boolean isIsogram(String str) {
-        return null;
+        char arr[] = str.toCharArray();
+
+        Arrays.sort(arr);
+        for(int i = 0; i<arr.length-1; i++){
+            if (arr[i] == arr[i+1]) {
+                return false;
+            }
+        }
+        return true;
     }
 
     public static Boolean hasDuplicateConsecutiveCharacters(String str) {
-        return null;
+        char arr[] = str.toCharArray();
+
+        for(int i = 0; i<arr.length-1; i++){
+            if (arr[i] == arr[i+1]) {
+                return true;
+            }
+        }
+        return false;
     }
 
     public static String removeConsecutiveDuplicateCharacters(String str) {
-        return null;
+        if(!hasDuplicateConsecutiveCharacters(str)){
+            return str;
+        }
+        return str;
     }
 
     public static String invertCasing(String str) {
-        return null;
+        char[] chars = str.toCharArray();
+        for(int i = 0; i < chars.length; i++){
+            char c = chars[i];
+            if(Character.isUpperCase(c)){
+                chars[i] = Character.toLowerCase(c);
+            } else if( Character.isLowerCase(c)){
+                chars[i] = Character.toUpperCase(c);
+            }
+        }
+        return new String(chars);
     }
 }

src/main/java/rocks/zipcode/quiz5/objectorientation/Curry.java

@@ -1,4 +1,4 @@
 package rocks.zipcode.quiz5.objectorientation;
 
-public class Curry {
+public class Curry implements Spice {
 }

src/main/java/rocks/zipcode/quiz5/objectorientation/Ginger.java

@@ -3,5 +3,5 @@ package rocks.zipcode.quiz5.objectorientation;
 /**
  * @author leon on 27/12/2018.
  */
-public class Ginger {
+public class Ginger implements Spice {
 }

src/main/java/rocks/zipcode/quiz5/objectorientation/Pepper.java

@@ -3,5 +3,5 @@ package rocks.zipcode.quiz5.objectorientation;
 /**
  * @author leon on 27/12/2018.
  */
-public class Pepper {
+public class Pepper implements Spice {
 }