fixed build issues

Author: albinsabu2023

src/main/java/com/thealgorithms/datastructures/lists/CreateAndDetectLoop.java

@@ -1,9 +1,12 @@
 package com.thealgorithms.datastructures.lists;
 
-public class CreateAndDetectLoop {
+public final class  CreateAndDetectLoop {
 
     // Node class representing a single node in the linked list
-    public static class Node {
+    private CreateAndDetectLoop() {
+        throw new UnsupportedOperationException("Utility class");
+    }
+     static final  class Node {
         int data;
         Node next;
 
@@ -34,8 +37,8 @@ static void createLoop(Node head, int position1, int position2) {
         Node node1 = head;  // node at position1
         Node node2 = head;  // node at position2
 
-        int count1 = 1, count2 = 1;
-
+        int count1 = 1;
+        int count2 = 1;
         // Traverse to find node at position1
         while (count1 < position1 && node1 != null) {
             node1 = node1.next;

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

@@ -1,10 +1,12 @@
 package com.thealgorithms.datastructures.lists;
 
-import static org.junit.jupiter.api.Assertions.*;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
 import org.junit.jupiter.api.BeforeEach;
 import org.junit.jupiter.api.Test;
 
-public class CreateAndDetectLoopTest {
+public class   CreateAndDetectLoopTest {
 
     private CreateAndDetectLoop.Node head;
 
@@ -26,13 +28,13 @@ void setUp() {
     }
 
     @Test
-    void testDetectLoop_NoLoop() {
+    void testDetectLoopNoLoop() {
         // Test when no loop exists
         assertFalse(CreateAndDetectLoop.detectLoop(head), "There should be no loop.");
     }
 
     @Test
-    void testCreateAndDetectLoop_LoopExists() {
+    void testCreateAndDetectLoopLoopExists() {
         // Create a loop between position 2 (node with value 2) and position 5 (node with value 5)
         CreateAndDetectLoop.createLoop(head, 2, 5);
 
@@ -41,7 +43,7 @@ void testCreateAndDetectLoop_LoopExists() {
     }
 
     @Test
-    void testCreateLoop_InvalidPosition() {
+    void testCreateLoopInvalidPosition() {
         // Create loop with invalid positions
         CreateAndDetectLoop.createLoop(head, 0, 0);
 
@@ -50,7 +52,7 @@ void testCreateLoop_InvalidPosition() {
     }
 
     @Test
-    void testCreateLoop_SelfLoop() {
+    void testCreateLoopSelfLoop() {
         // Create a self-loop at position 3 (node with value 3)
         CreateAndDetectLoop.createLoop(head, 3, 3);
 
@@ -59,7 +61,7 @@ void testCreateLoop_SelfLoop() {
     }
 
     @Test
-    void testCreateLoop_NoChangeForNonExistentPositions() {
+    void testCreateLoopNoChangeForNonExistentPositions() {
         // Create a loop with positions that don't exist in the linked list
         CreateAndDetectLoop.createLoop(head, 10, 20);