Parameterize references to generic types. (#5078)

* chore: remove unused imports

* fix: parameterize references to generic types


---------

Co-authored-by: vil02 <[email protected]>

Author: sozelfist

src/main/java/com/thealgorithms/backtracking/MColoring.java

@@ -1,6 +1,5 @@
 package com.thealgorithms.backtracking;
 
-import java.io.*;
 import java.util.*;
 
 /**

src/main/java/com/thealgorithms/datastructures/dynamicarray/DynamicArray.java

@@ -145,7 +145,7 @@ public String toString() {
      * @return Iterator a Dynamic Array Iterator
      */
     @Override
-    public Iterator iterator() {
+    public Iterator<E> iterator() {
         return new DynamicArrayIterator();
     }
 

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

@@ -53,7 +53,7 @@ public void append(E value) {
 
     // utility function for traversing the list
     public String toString() {
-        Node p = head.next;
+        Node<E> p = head.next;
         String s = "[ ";
         while (p != head) {
             s += p.value;
@@ -91,7 +91,7 @@ public E remove(int pos) {
     }
 
     public static void main(String[] args) {
-        CircleLinkedList cl = new CircleLinkedList<String>();
+        CircleLinkedList<Integer> cl = new CircleLinkedList<>();
         cl.append(12);
         System.out.println(cl);
         cl.append(23);

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

@@ -134,7 +134,7 @@ public void remove(T element) {
     }
 
     private void free(int index) {
-        Node os_node = cursorSpace[os];
+        Node<T> os_node = cursorSpace[os];
         int os_next = os_node.next;
         cursorSpace[os].next = index;
         cursorSpace[index].element = null;

src/main/java/com/thealgorithms/misc/ThreeSumProblem.java

@@ -75,7 +75,7 @@ public List<List<Integer>> TwoPointer(int[] nums, int target) {
 
     public List<List<Integer>> Hashmap(int[] nums, int target) {
         Arrays.sort(nums);
-        Set<List<Integer>> ts = new HashSet();
+        Set<List<Integer>> ts = new HashSet<>();
         HashMap<Integer, Integer> hm = new HashMap<>();
 
         for (int i = 0; i < nums.length; i++) {
@@ -94,6 +94,6 @@ public List<List<Integer>> Hashmap(int[] nums, int target) {
                 }
             }
         }
-        return new ArrayList(ts);
+        return new ArrayList<>(ts);
     }
 }

src/main/java/com/thealgorithms/searches/UnionFind.java

@@ -45,7 +45,7 @@ public void union(int x, int y) {
     }
 
     public int count() {
-        List parents = new ArrayList();
+        List<Integer> parents = new ArrayList<>();
         for (int i = 0; i < p.length; i++) {
             if (!parents.contains(find(i))) {
                 parents.add(find(i));

src/main/java/com/thealgorithms/strings/WordLadder.java

@@ -51,13 +51,13 @@ class WordLadder {
      * if the endword is there. Otherwise, will return the length as 0.
      */
     public static int ladderLength(String beginWord, String endWord, List<String> wordList) {
-        HashSet<String> set = new HashSet(wordList);
+        HashSet<String> set = new HashSet<>(wordList);
 
         if (!set.contains(endWord)) {
             return 0;
         }
 
-        Queue<String> queue = new LinkedList();
+        Queue<String> queue = new LinkedList<>();
         queue.offer(beginWord);
         int level = 1;