new changes

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

                 hashmap.put(splitString[i], hashmap.get(splitString[i]) + 1);
             }
         }
-
         for (Object word : hashmap.keySet()) {
 
             hashmap.get(word);
         }
-
         return hashmap;
 
     }

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

     public static Character getMiddleCharacter(String string) {
 
         int halfLength = string.length() / 2;
-        Character midChar;
+        char midChar;
 
         if (halfLength % 2 == 0) {
 
 
     public static String capitalizeMiddleCharacter(String str) {
 
-        return getMiddleCharacter(str).toString().toUpperCase();
+        char[] charArray = str.toCharArray();
+
+        charArray[charArray.length / 2] = Character.toUpperCase(charArray[charArray.length / 2]);
+        String newStr = new String(charArray);
+
+        return newStr;
     }
 
     public static String lowerCaseMiddleCharacter(String str) {
 
-        return getMiddleCharacter(str).toString().toLowerCase();
+        char[] charArray = str.toCharArray();
+
+        charArray[charArray.length / 2] = Character.toLowerCase(charArray[charArray.length / 2]);
+        String newStr = new String(charArray);
+
+        return newStr;
     }
 
     public static Boolean isIsogram(String str) {
 
     public static Boolean hasDuplicateConsecutiveCharacters(String str) {
 
-        for (int i = 0; i < str.length(); i++) {
+        for (int i = 1; i < str.length(); i++) {
 
-            if (str.charAt(i) == str.charAt(i)) ;
+            if (str.charAt(i) == str.charAt(i - 1))
 
             return true;
         }
 
     public static String removeConsecutiveDuplicateCharacters(String str) {
 
-        int position = 1;
-        char[] chars = str.toCharArray();
-
-        for (int i = 0; i < str.length(); i++) {
+       StringBuilder sb = new StringBuilder();
+       String[] array = str.split("");
+       String letter = array[0];
 
-            for (int j = 0; j < position; j++) {
+        for (int i = 1; i < array.length; i++) {
+            String nextLetter = array[i];
 
-                if (chars[i] == chars[j]) {
+            if(letter.equals(nextLetter)) {
+                array[i] = "";
+                array[i - 1] = "";
 
-                    break;
-                }
+            }else{
 
-                if (j == position) {
-
-                    chars[position] = chars[i];
-                    position++;
-
-                } else {
-
-                    chars[position] = 0;
-                    position++;
-                }
+                letter = array[i];
             }
         }
 
-        return str;
+        for(String s : array) {
+            sb.append(s);
+        }
+
+        return sb.toString();
     }
 
     public static String invertCasing(String str) {