reformat

Signed-off-by: ashKIK <ashutheprogrammer@gmail.com>

Author: px100

biweekly-52/SortingTheSentence.java

@@ -0,0 +1,16 @@
+import java.util.Arrays;
+import java.util.Comparator;
+import java.util.StringJoiner;
+
+public class SortingTheSentence {
+
+  public String sortSentence(String s) {
+    String[] str = s.split(" ");
+    Arrays.sort(str, Comparator.comparingInt(word -> word.charAt(word.length() - 1)));
+    StringJoiner res = new StringJoiner(" ");
+    for (String word : str) {
+      res.add(word.substring(0, word.length() - 1));
+    }
+    return res.toString();
+  }
+}

weekly-241/MinimumNumberOfSwapsToMakeTheBinaryStringAlternating.java

@@ -34,7 +34,7 @@ public int minSwaps(String s) {
     if (Math.abs(numOnes - numZeros) > 1) {
       return -1;
     }
-    // if the difference is odd, then impossible to make 10101 pattern, make 01010 instead
+    // if the difference is odd, it is impossible to make 10101 pattern, make 01010 instead
     // vice versa
     if (countOnes % 2 == 1) {
       return countZeros / 2;