diff --git a/src/main/java/BonusExercises.java b/src/main/java/BonusExercises.java
index 7fa393b..cbdfb79 100644
--- a/src/main/java/BonusExercises.java
+++ b/src/main/java/BonusExercises.java
@@ -227,6 +227,7 @@ public class BonusExercises {
     /*
         you should return a list of *words* which are palindromic
         by word we mean at least 3 letters with no whitespace in it
+        vv
 
         note: your implementation should be case-insensitive, e.g. Aba -> is palindrome
      */
diff --git a/src/main/java/MainExercises.java b/src/main/java/MainExercises.java
index 6ed7193..67d1c4c 100644
--- a/src/main/java/MainExercises.java
+++ b/src/main/java/MainExercises.java
@@ -132,7 +132,7 @@ public class MainExercises {
         1, 1, 1, 1
 
         Note: As you can see in the examples, we want to generate distinct partitions,
-        which means 1,2 and 2,1 are not different — they count as the same combination.
+        which m  eans 1,2 and 2,1 are not different — they count as the same combination.
 
         You should generate all partitions of the input number.