style: enable AvoidStarImport in checkstyle (#5141)

Author: vil02

checkstyle.xml

@@ -120,7 +120,7 @@
 
     <!-- Checks for imports                              -->
     <!-- See https://checkstyle.org/checks/imports/index.html -->
-    <!-- TODO <module name="AvoidStarImport"/> -->
+    <module name="AvoidStarImport"/>
     <module name="IllegalImport"/> <!-- defaults to sun.* packages -->
     <module name="RedundantImport"/>
     <module name="UnusedImports">

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

@@ -8,7 +8,8 @@
 /**Wikipedia link -> https://en.wikipedia.org/wiki/Shortest_path_problem */
 package com.thealgorithms.backtracking;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.List;
 
 public class AllPathsFromSourceToTarget {
 

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

@@ -1,6 +1,7 @@
 package com.thealgorithms.backtracking;
 
-import java.util.*;
+import java.util.List;
+import java.util.TreeSet;
 
 /**
  * Finds all permutations of 1...n of length k

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

@@ -1,6 +1,9 @@
 package com.thealgorithms.backtracking;
 
-import java.util.*;
+import java.util.Arrays;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.TreeSet;
 
 /**
  * Finds all permutations of given array

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

@@ -1,6 +1,8 @@
 package com.thealgorithms.backtracking;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.Comparator;
+import java.util.List;
 
 /*
     * Problem Statement: -

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

@@ -1,6 +1,10 @@
 package com.thealgorithms.backtracking;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.HashSet;
+import java.util.LinkedList;
+import java.util.Queue;
+import java.util.Set;
 
 /**
  * @author Bama Charan Chhandogi (https://github.com/BamaCharanChhandogi)

src/main/java/com/thealgorithms/ciphers/AESEncryption.java

@@ -3,7 +3,12 @@
 import java.security.InvalidAlgorithmParameterException;
 import java.security.InvalidKeyException;
 import java.security.NoSuchAlgorithmException;
-import javax.crypto.*;
+import javax.crypto.BadPaddingException;
+import javax.crypto.Cipher;
+import javax.crypto.IllegalBlockSizeException;
+import javax.crypto.KeyGenerator;
+import javax.crypto.NoSuchPaddingException;
+import javax.crypto.SecretKey;
 import javax.crypto.spec.GCMParameterSpec;
 
 /**

src/main/java/com/thealgorithms/conversions/BinaryToHexadecimal.java

@@ -1,6 +1,7 @@
 package com.thealgorithms.conversions;
 
-import java.util.*;
+import java.util.HashMap;
+import java.util.Scanner;
 
 /**
  * Converts any Binary Number to a Hexadecimal Number

src/main/java/com/thealgorithms/conversions/RomanToInteger.java

@@ -1,6 +1,7 @@
 package com.thealgorithms.conversions;
 
-import java.util.*;
+import java.util.HashMap;
+import java.util.Map;
 
 public class RomanToInteger {
 

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

@@ -1,6 +1,10 @@
 package com.thealgorithms.datastructures.dynamicarray;
 
-import java.util.*;
+import java.util.Arrays;
+import java.util.ConcurrentModificationException;
+import java.util.Iterator;
+import java.util.NoSuchElementException;
+import java.util.Objects;
 import java.util.function.Consumer;
 import java.util.stream.Stream;
 import java.util.stream.StreamSupport;

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

@@ -3,7 +3,11 @@
  */
 package com.thealgorithms.datastructures.graphs;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Comparator;
+import java.util.List;
+import java.util.PriorityQueue;
 
 public class A_Star {
 

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

@@ -1,6 +1,6 @@
 package com.thealgorithms.datastructures.graphs;
 
-import java.util.*;
+import java.util.Scanner;
 
 class BellmanFord /*
                    * Implementation of Bellman ford to detect negative cycles. Graph accepts

src/main/java/com/thealgorithms/datastructures/heaps/GenericHeap.java

@@ -1,6 +1,7 @@
 package com.thealgorithms.datastructures.heaps;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.HashMap;
 
 public class GenericHeap<T extends Comparable<T>> {
 

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

@@ -1,6 +1,11 @@
 package com.thealgorithms.datastructures.lists;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.List;
+import java.util.Objects;
+import java.util.Random;
 import java.util.stream.Collectors;
 import java.util.stream.IntStream;
 

src/main/java/com/thealgorithms/datastructures/trees/PostOrderTraversal.java

@@ -1,6 +1,10 @@
 package com.thealgorithms.datastructures.trees;
 
-import java.util.*;
+import java.util.ArrayDeque;
+import java.util.ArrayList;
+import java.util.Deque;
+import java.util.LinkedList;
+import java.util.List;
 
 /**
  * Given tree is traversed in a 'post-order' way: LEFT -> RIGHT -> ROOT.

src/main/java/com/thealgorithms/datastructures/trees/ZigzagTraversal.java

@@ -1,6 +1,10 @@
 package com.thealgorithms.datastructures.trees;
 
-import java.util.*;
+import java.util.ArrayDeque;
+import java.util.ArrayList;
+import java.util.Deque;
+import java.util.LinkedList;
+import java.util.List;
 
 /**
  * Given a binary tree.

src/main/java/com/thealgorithms/maths/DeterminantOfMatrix.java

@@ -1,6 +1,6 @@
 package com.thealgorithms.maths;
 
-import java.util.*;
+import java.util.Scanner;
 
 /*
  * @author Ojasva Jain

src/main/java/com/thealgorithms/maths/KaprekarNumbers.java

@@ -1,7 +1,8 @@
 package com.thealgorithms.maths;
 
 import java.math.BigInteger;
-import java.util.*;
+import java.util.ArrayList;
+import java.util.List;
 
 public class KaprekarNumbers {
 

src/main/java/com/thealgorithms/maths/KeithNumber.java

@@ -1,6 +1,8 @@
 package com.thealgorithms.maths;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.Scanner;
 
 class KeithNumber {
 

src/main/java/com/thealgorithms/maths/KrishnamurthyNumber.java

@@ -5,7 +5,9 @@
 to the number itself. For example, 1, 2 and 145 are Krishnamurthy numbers. Krishnamurthy number is
 also referred to as a Strong number.
  */
-import java.io.*;
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
 
 public class KrishnamurthyNumber {
 

src/main/java/com/thealgorithms/maths/LeastCommonMultiple.java

@@ -1,6 +1,6 @@
 package com.thealgorithms.maths;
 
-import java.util.*;
+import java.util.Scanner;
 
 /**
  * Is a common mathematics concept to find the smallest value number

src/main/java/com/thealgorithms/maths/MagicSquare.java

@@ -1,6 +1,6 @@
 package com.thealgorithms.maths;
 
-import java.util.*;
+import java.util.Scanner;
 
 /*A magic square of order n is an arrangement of distinct n^2 integers,in a square, such that the n
 numbers in all rows, all columns, and both diagonals sum to the same constant. A magic square

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

@@ -1,6 +1,6 @@
 package com.thealgorithms.misc;
 
-import java.util.*;
+import java.util.Arrays;
 
 public class RangeInSortedArray {
 

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

@@ -1,6 +1,6 @@
 package com.thealgorithms.misc;
 
-import java.util.*;
+import java.util.Scanner;
 
 /**
  * The array is divided into four sections: a[1..Lo-1] zeroes a[Lo..Mid-1] ones

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

@@ -1,6 +1,6 @@
 package com.thealgorithms.misc;
 
-import java.util.*;
+import java.util.Scanner;
 
 /*
  *A matrix is sparse if many of its coefficients are zero (In general if 2/3rd of matrix elements

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

@@ -1,6 +1,14 @@
 package com.thealgorithms.misc;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.LinkedHashSet;
+import java.util.List;
+import java.util.Scanner;
+import java.util.Set;
 
 public class ThreeSumProblem {
 

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

@@ -1,6 +1,12 @@
 package com.thealgorithms.misc;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
 
 public class WordBoggle {
 

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

@@ -1,6 +1,8 @@
 package com.thealgorithms.others;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
 
 public class Conway {
 

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

@@ -15,7 +15,10 @@
  * https://rosettacode.org/wiki/Dijkstra%27s_algorithm#Java Also most of the
  * comments are from RosettaCode.
  */
-import java.util.*;
+import java.util.HashMap;
+import java.util.Map;
+import java.util.NavigableSet;
+import java.util.TreeSet;
 
 public class Dijkstra {
 

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

@@ -1,6 +1,6 @@
 package com.thealgorithms.others;
 
-import java.util.*;
+import java.util.Scanner;
 
 public class InsertDeleteInArray {
 

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

@@ -1,6 +1,8 @@
 package com.thealgorithms.others;
 
-import java.awt.*;
+import java.awt.BasicStroke;
+import java.awt.Color;
+import java.awt.Graphics2D;
 import java.awt.image.BufferedImage;
 import java.io.File;
 import java.io.IOException;

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

@@ -1,6 +1,6 @@
 package com.thealgorithms.others;
 
-import java.awt.*;
+import java.awt.Color;
 import java.awt.image.BufferedImage;
 import java.io.File;
 import java.io.IOException;

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

@@ -1,6 +1,6 @@
 package com.thealgorithms.others;
 
-import java.util.*;
+import java.util.Scanner;
 
 class PageRank {
 

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

@@ -4,7 +4,7 @@
  * Given a matrix of size n x n We have to rotate this matrix by 90 Degree Here
  * is the algorithm for this problem .
  */
-import java.util.*;
+import java.util.Scanner;
 
 class Rotate_by_90_degree {
 

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

@@ -1,7 +1,13 @@
 package com.thealgorithms.others;
 
-import java.io.*;
-import java.util.*;
+import java.io.FileInputStream;
+import java.io.IOException;
+import java.util.ArrayList;
+import java.util.Comparator;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.Scanner;
 
 /* display the most frequent K words in the file and the times it appear
 in the file – shown in order (ignore case and periods) */

src/main/java/com/thealgorithms/scheduling/PreemptivePriorityScheduling.java

@@ -1,6 +1,9 @@
 package com.thealgorithms.scheduling;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.Comparator;
+import java.util.List;
+import java.util.PriorityQueue;
 
 /**
  * Preemptive Priority Scheduling Algorithm

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

@@ -1,7 +1,11 @@
 package com.thealgorithms.searches;
 
 import com.thealgorithms.datastructures.Node;
-import java.util.*;
+import java.util.ArrayDeque;
+import java.util.ArrayList;
+import java.util.List;
+import java.util.Optional;
+import java.util.Queue;
 
 /**
  * @author: caos321

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

@@ -1,6 +1,6 @@
 package com.thealgorithms.searches;
 
-import java.util.*;
+import java.util.Scanner;
 
 /*
     Problem Statement: