chore: suppress unchecked in selected classes (#6262)

pom.xml

@@ -76,7 +76,6 @@
                     <compilerArgs>
                         <arg>-Xlint:all</arg>
                         <arg>-Xlint:-auxiliaryclass</arg>
-                        <arg>-Xlint:-unchecked</arg>
                         <arg>-Werror</arg>
                     </compilerArgs>
                 </configuration>

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

@@ -9,7 +9,7 @@ import java.util.List;
  *
  * @author <a href="https://github.com/siddhant2002">Siddhant Swarup Mallick</a>
  */
-@SuppressWarnings("rawtypes")
+@SuppressWarnings({"rawtypes", "unchecked"})
 public class AllPathsFromSourceToTarget {
 
     // No. of vertices in graph

src/main/java/com/thealgorithms/datastructures/buffers/CircularBuffer.java

@@ -10,6 +10,7 @@ import java.util.concurrent.atomic.AtomicInteger;
  *
  * @param <Item> The type of elements stored in the circular buffer.
  */
+@SuppressWarnings("unchecked")
 public class CircularBuffer<Item> {
     private final Item[] buffer;
     private final CircularPointer putPointer;

src/main/java/com/thealgorithms/datastructures/graphs/Kruskal.java

@@ -19,7 +19,7 @@ import java.util.PriorityQueue;
  *
  * <p><strong>Time Complexity:</strong> O(E log V), where E is the number of edges and V is the number of vertices.</p>
  */
-@SuppressWarnings("rawtypes")
+@SuppressWarnings({"rawtypes", "unchecked"})
 public class Kruskal {
 
     /**

src/main/java/com/thealgorithms/datastructures/graphs/WelshPowell.java

@@ -22,7 +22,7 @@ import java.util.stream.IntStream;
  * For more information, see <a href="https://en.wikipedia.org/wiki/Graph_coloring">Graph Coloring</a>.
  * </p>
  */
-@SuppressWarnings("rawtypes")
+@SuppressWarnings({"rawtypes", "unchecked"})
 public final class WelshPowell {
     private static final int BLANK_COLOR = -1; // Constant representing an uncolored state
 

src/main/java/com/thealgorithms/datastructures/hashmap/hashing/GenericHashMapUsingArray.java

@@ -23,7 +23,7 @@ import java.util.LinkedList;
  * @param <K> the type of keys maintained by this hash map
  * @param <V> the type of mapped values
  */
-@SuppressWarnings("rawtypes")
+@SuppressWarnings({"rawtypes", "unchecked"})
 public class GenericHashMapUsingArray<K, V> {
 
     private int size; // Total number of key-value pairs

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

@@ -10,7 +10,7 @@ import java.util.Objects;
  *
  * @param <T> the type of elements in this list
  */
-@SuppressWarnings("rawtypes")
+@SuppressWarnings({"rawtypes", "unchecked"})
 public class CursorLinkedList<T> {
 
     /**

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

@@ -29,7 +29,7 @@ import java.util.stream.IntStream;
  * @param <E> type of elements
  * @see <a href="https://en.wikipedia.org/wiki/Skip_list">Wiki. Skip list</a>
  */
-@SuppressWarnings("rawtypes")
+@SuppressWarnings({"rawtypes", "unchecked"})
 public class SkipList<E extends Comparable<E>> {
 
     /**

src/main/java/com/thealgorithms/datastructures/queues/QueueByTwoStacks.java

@@ -11,6 +11,7 @@ import java.util.Stack;
  *
  * @param <T> The type of elements held in this queue.
  */
+@SuppressWarnings("unchecked")
 public class QueueByTwoStacks<T> {
 
     private final Stack<T> enqueueStk;

src/main/java/com/thealgorithms/dynamicprogramming/LongestArithmeticSubsequence.java

@@ -2,7 +2,7 @@ package com.thealgorithms.dynamicprogramming;
 
 import java.util.HashMap;
 
-@SuppressWarnings("rawtypes")
+@SuppressWarnings({"rawtypes", "unchecked"})
 final class LongestArithmeticSubsequence {
     private LongestArithmeticSubsequence() {
     }

src/main/java/com/thealgorithms/others/CRCAlgorithm.java

@@ -7,6 +7,7 @@ import java.util.concurrent.ThreadLocalRandom;
 /**
  * @author dimgrichr
  */
+@SuppressWarnings("unchecked")
 public class CRCAlgorithm {
 
     private int correctMess;

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

@@ -15,7 +15,7 @@ import com.thealgorithms.devutils.searches.SearchAlgorithm;
  * Note: This algorithm requires that the input array be sorted.
  * </p>
  */
-@SuppressWarnings("rawtypes")
+@SuppressWarnings({"rawtypes", "unchecked"})
 public class FibonacciSearch implements SearchAlgorithm {
 
     /**

src/main/java/com/thealgorithms/sorts/TimSort.java

@@ -7,7 +7,7 @@ import static com.thealgorithms.sorts.SortUtils.less;
  * <p>
  * For more details @see <a href="https://en.wikipedia.org/wiki/Timsort">TimSort Algorithm</a>
  */
-@SuppressWarnings("rawtypes")
+@SuppressWarnings({"rawtypes", "unchecked"})
 class TimSort implements SortAlgorithm {
     private static final int SUB_ARRAY_SIZE = 32;
     private Comparable[] aux;

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

@@ -10,7 +10,7 @@ import java.util.List;
 import org.junit.jupiter.api.BeforeEach;
 import org.junit.jupiter.api.Test;
 
-@SuppressWarnings("rawtypes")
+@SuppressWarnings({"rawtypes", "unchecked"})
 public class KruskalTest {
 
     private Kruskal kruskal;

src/test/java/com/thealgorithms/maths/NumberOfDigitsTest.java

@@ -8,7 +8,7 @@ import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.Arguments;
 import org.junit.jupiter.params.provider.MethodSource;
 
-@SuppressWarnings("rawtypes")
+@SuppressWarnings({"rawtypes", "unchecked"})
 public class NumberOfDigitsTest {
 
     @ParameterizedTest