diff --git a/src/main/java/com/thealgorithms/backtracking/Permutation.java b/src/main/java/com/thealgorithms/backtracking/Permutation.java index 58cc29918..e48d8539e 100644 --- a/src/main/java/com/thealgorithms/backtracking/Permutation.java +++ b/src/main/java/com/thealgorithms/backtracking/Permutation.java @@ -1,6 +1,5 @@ package com.thealgorithms.backtracking; -import java.util.Arrays; import java.util.LinkedList; import java.util.List; diff --git a/src/main/java/com/thealgorithms/maths/Ceil.java b/src/main/java/com/thealgorithms/maths/Ceil.java index 08cc05cf4..f9b570fca 100644 --- a/src/main/java/com/thealgorithms/maths/Ceil.java +++ b/src/main/java/com/thealgorithms/maths/Ceil.java @@ -1,7 +1,5 @@ package com.thealgorithms.maths; -import java.util.Random; - public class Ceil { /** diff --git a/src/main/java/com/thealgorithms/maths/DigitalRoot.java b/src/main/java/com/thealgorithms/maths/DigitalRoot.java index 73aed0854..16f67e6d2 100644 --- a/src/main/java/com/thealgorithms/maths/DigitalRoot.java +++ b/src/main/java/com/thealgorithms/maths/DigitalRoot.java @@ -36,8 +36,6 @@ */ package com.thealgorithms.maths; -import java.util.*; - class DigitalRoot { public static int digitalRoot(int n) { diff --git a/src/main/java/com/thealgorithms/maths/PascalTriangle.java b/src/main/java/com/thealgorithms/maths/PascalTriangle.java index 62ee3bc9a..b2ae1c5fe 100644 --- a/src/main/java/com/thealgorithms/maths/PascalTriangle.java +++ b/src/main/java/com/thealgorithms/maths/PascalTriangle.java @@ -1,6 +1,4 @@ package com.thealgorithms.maths; - -import java.util.Scanner; public class PascalTriangle { /** *In mathematics, Pascal's triangle is a triangular array of the binomial coefficients that arises diff --git a/src/main/java/com/thealgorithms/maths/SquareRootWithBabylonianMethod.java b/src/main/java/com/thealgorithms/maths/SquareRootWithBabylonianMethod.java index 306bb1234..a79927fc4 100644 --- a/src/main/java/com/thealgorithms/maths/SquareRootWithBabylonianMethod.java +++ b/src/main/java/com/thealgorithms/maths/SquareRootWithBabylonianMethod.java @@ -1,7 +1,5 @@ package com.thealgorithms.maths; -import java.util.Scanner; - public class SquareRootWithBabylonianMethod { /** diff --git a/src/test/java/com/thealgorithms/backtracking/CombinationTest.java b/src/test/java/com/thealgorithms/backtracking/CombinationTest.java index 78e75b543..19f7b10ae 100644 --- a/src/test/java/com/thealgorithms/backtracking/CombinationTest.java +++ b/src/test/java/com/thealgorithms/backtracking/CombinationTest.java @@ -2,7 +2,6 @@ package com.thealgorithms.backtracking; import org.junit.jupiter.api.Test; -import java.util.Arrays; import java.util.List; import java.util.TreeSet; diff --git a/src/test/java/com/thealgorithms/sorts/DutchNationalFlagSortTest.java b/src/test/java/com/thealgorithms/sorts/DutchNationalFlagSortTest.java index 56df1b359..9e05f6cd9 100644 --- a/src/test/java/com/thealgorithms/sorts/DutchNationalFlagSortTest.java +++ b/src/test/java/com/thealgorithms/sorts/DutchNationalFlagSortTest.java @@ -1,8 +1,6 @@ package com.thealgorithms.sorts; import org.junit.jupiter.api.Test; -import java.util.Arrays; - import static org.junit.jupiter.api.Assertions.*; public class DutchNationalFlagSortTest {