update 249

Author: fishercoder1534

Diff for: src/main/java/com/fishercoder/solutions/_249.java

@@ -17,9 +17,9 @@ public List<List<String>> groupStrings(String[] strings) {
             for (String word : strings) {
                 //calculate the representative/key that's unique for the entire group
                 //i.e. if the two string belong to the same group, after shifting n times, they all will end up having the same key
-                // abc -> 2021
-                // xyz -> 2021
-                // acef -> 212324
+                // abc -> "2021"
+                // xyz -> "2021"
+                // acef -> "212324"
                 String key = "";
                 int offset = word.charAt(0) - 'a';
                 for (int i = 1; i < word.length(); i++) {