diff --git a/checkstyle.xml b/checkstyle.xml
index af5e3527e..4fc237d29 100644
--- a/checkstyle.xml
+++ b/checkstyle.xml
@@ -143,7 +143,7 @@
-
+
diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/UniquePaths.java b/src/main/java/com/thealgorithms/dynamicprogramming/UniquePaths.java
index c48bdea2d..80b553f27 100644
--- a/src/main/java/com/thealgorithms/dynamicprogramming/UniquePaths.java
+++ b/src/main/java/com/thealgorithms/dynamicprogramming/UniquePaths.java
@@ -19,7 +19,8 @@ import java.util.Arrays;
public final class UniquePaths {
- private UniquePaths(){};
+ private UniquePaths() {
+ }
/**
* Calculates the number of unique paths using a 1D dynamic programming array.
diff --git a/src/test/java/com/thealgorithms/maths/MeansTest.java b/src/test/java/com/thealgorithms/maths/MeansTest.java
index a1c07e25b..bb2b4b6d1 100644
--- a/src/test/java/com/thealgorithms/maths/MeansTest.java
+++ b/src/test/java/com/thealgorithms/maths/MeansTest.java
@@ -59,7 +59,7 @@ class MeansTest {
@Test
void geometricMeanMultipleNumbers() {
- LinkedList numbers = new LinkedList<>() {};
+ LinkedList numbers = new LinkedList<>();
numbers.addAll(Lists.newArrayList(1d, 2d, 3d, 4d, 5d, 6d, 1.25));
assertEquals(2.6426195539300585, Means.geometric(numbers));
}