100 tests

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

@@ -23,7 +23,7 @@ public class Food extends HashMap<Spice, Integer> {
     }
 
     public void applySpice(Spice spice) {
-        if(Spices.containsValue(spice)){
+        if(Spices.containsKey(spice)){
             Spices.put(spice, Spices.get(spice)+1);
         }else{
             Spices.put(spice, 1);

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

@@ -3,15 +3,21 @@ package rocks.zipcode.quiz5.collections;
 import java.util.*;
 
 public class WordCounter {
-
     Map<String, Integer> wordCounter= new HashMap<>();
 
     public WordCounter(String... strings) {
-
+        for(String string : strings){
+            if(wordCounter.containsKey(string)){
+                Integer newValue = wordCounter.get(string) + 1;
+                wordCounter.put(string, newValue);
+            }else{
+                wordCounter.put(string, 1);
+            }
+        }
 
     }
 
     public Map<String, Integer> getWordCountMap() {
-        return null;
+        return wordCounter;
     }
 }

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

@@ -5,31 +5,40 @@ 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;
+        Double square = value*value;
+        return square;
     }
 
     public static Double[] squareRoots(Double... value) {
-        return null;
+        Double[] fin = new Double[value.length];
+        for(int i = 0; i < value.length; i++){
+            fin[i] = squareRoot(value[i]);
+        }
+        return fin;
     }
 
     public static Double[] squares(Double... values) {
-        return null;
+        Double[] fin = new Double[values.length];
+        for(int i = 0; i < values.length; i++){
+            fin[i] = square(values[i]);
+        }
+        return fin;
     }
 
     public static Double add(Double value1, Double value2) {
-        return null;
+        return 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,23 +1,45 @@
 package rocks.zipcode.quiz5.fundamentals;
 
+import java.util.*;
+
 /**
  * @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;
+        int middle = str.length()/2;
+        String upper = str.substring(middle, middle+1).toUpperCase();
+        String[] strArray = str.split("");
+        strArray[middle] = upper;
+        String fin = "";
+        for(String string : strArray){
+            fin = fin.concat(string);
+        }
+        return fin;
+
     }
 
     public static String lowerCaseMiddleCharacter(String str) {
-        return null;
+        int middle = str.length()/2;
+        String upper = str.substring(middle, middle+1).toLowerCase();
+        String[] strArray = str.split("");
+        strArray[middle] = upper;
+        String fin = "";
+        for(String string : strArray){
+            fin = fin.concat(string);
+        }
+        return fin;
     }
 
     public static Boolean isIsogram(String str) {
-        return null;
+        Set<Character>  set = new HashSet<>();
+        for(int i = 0; i < str.length(); i++) set.add(str.charAt(i));
+        if(set.size() == str.length()) return true;
+        return false;
     }
 
     public static Boolean hasDuplicateConsecutiveCharacters(String str) {
@@ -25,10 +47,39 @@ public class StringUtils {
     }
 
     public static String removeConsecutiveDuplicateCharacters(String str) {
-        return null;
+        boolean isContinued = true;
+        String[] strArray = str.split("");
+        String fin = "";
+        while(isContinued){
+            //if(strArray)
+        }
+        return fin;
     }
 
     public static String invertCasing(String str) {
-        return null;
+        String[] strArray = str.split("");
+        String fin = "";
+        for(String string : strArray){
+            if(isUpperCase(string)){
+               String temp =  string.toLowerCase();
+               fin = fin.concat(temp);
+            }
+            else if(!isUpperCase(string)){
+               String temp = string.toUpperCase();
+               fin = fin.concat(temp);
+            }
+        }
+        return fin;
+    }
+
+    public static boolean isUpperCase(String s) {
+        for (int i=0; i<s.length(); i++)
+        {
+            if (Character.isLowerCase(s.charAt(i)))
+            {
+                return false;
+            }
+        }
+        return true;
     }
 }