fix: Fix README.md formatting

src/main/java/algorithm/BinarySearchIn2dArraySnippet.java

@@ -92,4 +92,4 @@ static int[] binarySearch(int[][] matrix, int target, int row, int cstart, int c
     }
     return new int[]{-1, -1};
   }
-}
+}

src/main/java/algorithm/BinarySearchSnippet.java

@@ -27,7 +27,6 @@
 /**
  * BinarySearchSnippet.
  */
-
 public class BinarySearchSnippet {
 
   /**
@@ -53,5 +52,4 @@ public static int binarySearch(int[] arr, int left, int right, int item) {
     }
     return -1;
   }
-
 }

src/main/java/algorithm/CycleSortSnippet.java

@@ -27,7 +27,6 @@
 /**
  * CycleSortSnippet.
  */
-
 public class CycleSortSnippet {
 
   /**
@@ -48,9 +47,6 @@ public static int[] cycleSort(int[] arr) {
         i++;
       }
     }
-
     return arr;
   }
-
-
 }

src/main/java/algorithm/LinearSearchIn2dArraySnippet.java

@@ -46,7 +46,6 @@ public static int[] linearSearch2dArray(int[][] arr, int target) {
         }
       }
     }
-
     return new int[]{-1, -1};
   }
-}
+}

src/main/java/algorithm/LinearSearchSnippet.java

@@ -44,5 +44,4 @@ public static int linearSearch(int[] arr, int item) {
     }
     return -1;
   }
-
 }

src/main/java/algorithm/MergeSortSnippet.java

@@ -27,14 +27,13 @@
 /**
  * MergeSortSnippet.
  */
-
 public class MergeSortSnippet {  
   /**
      * Sort an array with qmergesort algorithm.
      *
      * @param arr   array to sort
-     *     left  left index where to begin sort (e.g. 0)
-     *     right index where to end sort (e.g. array length - 1)
+     * @low low index where to begin sort (e.g. 0)
+     * @high high index where to end sort (e.g. array length - 1)
      */
 
   public static void mergeSort(int[] arr, int low, int high) {
@@ -77,5 +76,4 @@ private static void merge(int[] arr, int low, int high, int mid) {
       arr[n] = temp[m];
     }
   }
-
 }

src/main/java/algorithm/SieveOfEratosthenesSnippet.java

@@ -27,7 +27,6 @@
 /**
  * SieveOfEratosthenesSnippet.
  */
-
 public class SieveOfEratosthenesSnippet {
   /**
    * Search an item with binarySearch algorithm.

src/main/java/date/DateDifferenceSnippet.java

@@ -71,6 +71,4 @@ public static long getDaysDifference(LocalDate firstTime, LocalDate secondTime)
     var daysDifference = ChronoUnit.DAYS.between(firstTime, secondTime);
     return Math.abs(daysDifference);
   }
-
-
 }

src/main/java/math/DiceThrow.java

@@ -70,9 +70,6 @@ public static int throwDice(int noOfDice, DiceSides sides) {
     for (int i = 0; i < noOfDice; i++) {
       sum = sum + (1 + random.nextInt(sides.getDiceSides()));
     }
-
     return sum;
-
   }
-
-}
+}

src/main/java/math/EloRatingSnippet.java

@@ -25,7 +25,7 @@
 package math;
 
 /**
- * FactorialSnippet.
+ * EloRatingSnippet.
  */
 public class EloRatingSnippet {
 
@@ -51,4 +51,4 @@ public static double calculateMatchRating(double firstPlayerRating, double secon
                        - firstPlayerExpectedScore);
     return newRating;
   }
-}
+}

src/main/java/math/LeastCommonMultipleSnippet.java

@@ -46,4 +46,4 @@ public static int lcm(int a, int b) {
     }
     return max * min;
   }
-}
+}

src/main/java/math/LuhnSnippet.java

@@ -63,5 +63,4 @@ public static int calculateLuhnChecksum(long num) {
     // Outermost modulus handles edge case `num = 0`.
     return checksumDigit;
   }
-
 }

src/main/java/math/NaturalNumberBinaryConversionSnippet.java

@@ -72,5 +72,4 @@ public static Long fromBinary(String binary) {
             .filter(in -> binary.charAt(binary.length() - 1 - in) == '1')
             .mapToLong(in -> ((long) 0b1) << in).sum();
   }
-
 }

src/main/java/math/RandomNumber.java

@@ -68,5 +68,4 @@ public static <T extends Number> Number getRandomNumber(T start, T end) {
               + start.getClass() + " and " + end.getClass());
     }
   }
-
 }

src/main/java/string/CompareVersionSnippet.java

@@ -59,4 +59,4 @@ public static int compareVersion(String v1, String v2) {
   private static String[] getVersionComponents(String version) {
     return version.replaceAll(EXTRACT_VERSION_REGEX, "$1").split("\\.");
   }
-}
+}

src/main/java/string/DuplicateCharacterSnippet.java

@@ -30,7 +30,6 @@
 /**
  * DuplicateCharacterSnippet.
  */
-
 public class DuplicateCharacterSnippet {
 
   /**

src/main/java/string/MaxCharacterCountSnippet.java

@@ -50,6 +50,4 @@ public static int getMaxCharacterCount(String str, char character) {
     }
     return maxCharacterCount;
   }
-
-
-}
+}

src/main/java/string/ReversStringSnippet.java → src/main/java/string/ReverseStringSnippet.java

@@ -27,7 +27,7 @@
 /**
  * ReversStringSnippet.
  */
-public class ReversStringSnippet {
+public class ReverseStringSnippet {
 
   /**
    * Reverse string.

src/test/java/string/ReversStringSnippetTest.java → src/test/java/string/ReverseStringSnippetTest.java

@@ -32,13 +32,13 @@
  * Tests for 30 Seconds of Java code library
  *
  */
-class ReversStringSnippetTest {
+class ReverseStringSnippetTest {
   /**
-   * Tests for {@link ReversStringSnippet#reverseString(String)}.
+   * Tests for {@link ReverseStringSnippet#reverseString(String)}.
    */
   @Test
   void testReverseString() {
-    assertEquals("oof", ReversStringSnippet.reverseString("foo"));
-    assertEquals("ÖÄÅ321FED cba", ReversStringSnippet.reverseString("abc DEF123ÅÄÖ"));
+    assertEquals("oof", ReverseStringSnippet.reverseString("foo"));
+    assertEquals("ÖÄÅ321FED cba", ReverseStringSnippet.reverseString("abc DEF123ÅÄÖ"));
   }
-}
+}

src/test/java/string/StringToDateSnippetTest.java

@@ -46,4 +46,4 @@ void testStringToDate() throws ParseException {
     assertEquals(8, calendar.get(Calendar.MONTH) + 1);
     assertEquals(18, calendar.get(Calendar.DAY_OF_MONTH));
   }
-}
+}