style: enable InvalidJavadocPosition in checkstyle (#5237)

enable style InvalidJavadocPosition

Co-authored-by: Samuel Facchinello <samuel.facchinello@piksel.com>

src/test/java/com/thealgorithms/bitmanipulation/NumbersDifferentSignsTest.java

@@ -1,15 +1,13 @@
 package com.thealgorithms.bitmanipulation;
 
-/**
- * test Cases of Numbers Different Signs
- * @author Bama Charan Chhandogi
- */
-
 import static org.junit.jupiter.api.Assertions.assertFalse;
 import static org.junit.jupiter.api.Assertions.assertTrue;
 
 import org.junit.jupiter.api.Test;
-
+/**
+ * test Cases of Numbers Different Signs
+ * @author Bama Charan Chhandogi
+ */
 class NumbersDifferentSignsTest {
 
     @Test

src/test/java/com/thealgorithms/datastructures/graphs/BoruvkaAlgorithmTest.java

@@ -30,7 +30,7 @@ public class BoruvkaAlgorithmTest {
         edges.add(new BoruvkaAlgorithm.Edge(7, 8, 11));
 
         final var graph = new Graph(9, edges);
-        /**
+        /*
          * Adjacency matrix
          *    0   1   2   3   4   5   6   7   8
          * 0  0  10  12   0   0   0   0   0   0
@@ -56,7 +56,7 @@ public class BoruvkaAlgorithmTest {
 
         final var graph = new Graph(2, edges);
 
-        /**
+        /*
          * Adjacency matrix
          *    0  1
          * 0  0  10
@@ -79,7 +79,7 @@ public class BoruvkaAlgorithmTest {
 
         final var graph = new Graph(4, edges);
 
-        /**
+        /*
          * Adjacency matrix
          *    0  1  2  3
          * 0  0  7  2  5

src/test/java/com/thealgorithms/datastructures/lists/QuickSortLinkedListTest.java

@@ -1,16 +1,14 @@
 package com.thealgorithms.datastructures.lists;
 
-/**
- * Test cases for QuickSortLinkedList
- * Author: Prabhat-Kumar-42
- * GitHub: https://github.com/Prabhat-Kumar-42
- */
-
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertNull;
 
 import org.junit.jupiter.api.Test;
-
+/**
+ * Test cases for QuickSortLinkedList
+ * Author: Prabhat-Kumar-42
+ * GitHub: https://github.com/Prabhat-Kumar-42
+ */
 public class QuickSortLinkedListTest {
 
     @Test

src/test/java/com/thealgorithms/datastructures/lists/ReverseKGroupTest.java

@@ -1,15 +1,13 @@
 package com.thealgorithms.datastructures.lists;
 
-/**
- * Test cases for Reverse K Group LinkedList
- * Author: Bama Charan Chhandogi (https://github.com/BamaCharanChhandogi)
- */
-
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertNull;
 
 import org.junit.jupiter.api.Test;
-
+/**
+ * Test cases for Reverse K Group LinkedList
+ * Author: Bama Charan Chhandogi (https://github.com/BamaCharanChhandogi)
+ */
 public class ReverseKGroupTest {
 
     @Test

src/test/java/com/thealgorithms/datastructures/lists/RotateSinglyLinkedListsTest.java

@@ -1,15 +1,14 @@
 package com.thealgorithms.datastructures.lists;
 
-/**
- * Test cases for RotateSinglyLinkedLists
- * Author: Bama Charan Chhandogi (https://github.com/BamaCharanChhandogi)
- */
-
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertNull;
 
 import org.junit.jupiter.api.Test;
 
+/**
+ * Test cases for RotateSinglyLinkedLists
+ * Author: Bama Charan Chhandogi (https://github.com/BamaCharanChhandogi)
+ */
 public class RotateSinglyLinkedListsTest {
 
     @Test

src/test/java/com/thealgorithms/scheduling/PreemptivePrioritySchedulingTest.java

@@ -1,10 +1,5 @@
 package com.thealgorithms.scheduling;
 
-/**
- * Test Cases of Preemptive Priority Scheduling Algorithm
- * @author [Bama Charan Chhandogi](https://www.github.com/BamaCharanChhandogi)
- */
-
 import static org.junit.jupiter.api.Assertions.assertEquals;
 
 import java.util.ArrayList;
@@ -12,6 +7,10 @@ import java.util.Arrays;
 import java.util.List;
 import org.junit.jupiter.api.Test;
 
+/**
+ * Test Cases of Preemptive Priority Scheduling Algorithm
+ * @author [Bama Charan Chhandogi](https://www.github.com/BamaCharanChhandogi)
+ */
 class PreemptivePrioritySchedulingTest {
 
     @Test

src/test/java/com/thealgorithms/strings/WordLadderTest.java

@@ -8,30 +8,32 @@ import org.junit.jupiter.api.Test;
 
 public class WordLadderTest {
 
+    /**
+     * Test 1:
+     * Input: beginWord = "hit", endWord = "cog", wordList =
+     * ["hot","dot","dog","lot","log","cog"]
+     * Output: 5
+     * Explanation: One shortest transformation sequence is
+     * "hit" -> "hot" -> "dot" -> "dog" -> cog"
+     * which is 5 words long.
+     */
     @Test
     public void testWordLadder() {
 
-        /**
-         * Test 1:
-         * Input: beginWord = "hit", endWord = "cog", wordList =
-         * ["hot","dot","dog","lot","log","cog"]
-         * Output: 5
-         * Explanation: One shortest transformation sequence is
-         * "hit" -> "hot" -> "dot" -> "dog" -> cog"
-         * which is 5 words long.
-         */
-
         List<String> wordList1 = Arrays.asList("hot", "dot", "dog", "lot", "log", "cog");
         assertEquals(WordLadder.ladderLength("hit", "cog", wordList1), 5);
+    }
 
-        /**
-         * Test 2:
-         * Input: beginWord = "hit", endWord = "cog", wordList =
-         * ["hot","dot","dog","lot","log"]
-         * Output: 0
-         * Explanation: The endWord "cog" is not in wordList,
-         * therefore there is no valid transformation sequence.
-         */
+    /**
+     * Test 2:
+     * Input: beginWord = "hit", endWord = "cog", wordList =
+     * ["hot","dot","dog","lot","log"]
+     * Output: 0
+     * Explanation: The endWord "cog" is not in wordList,
+     * therefore there is no valid transformation sequence.
+     */
+    @Test
+    public void testWordLadder2() {
 
         List<String> wordList2 = Arrays.asList("hot", "dot", "dog", "lot", "log");
         assertEquals(WordLadder.ladderLength("hit", "cog", wordList2), 0);