diff --git a/pom.xml b/pom.xml
index 21b5ec350..134732953 100644
--- a/pom.xml
+++ b/pom.xml
@@ -79,7 +79,6 @@
-Xlint:all
-Xlint:-auxiliaryclass
-Xlint:-rawtypes
- -Xlint:-try
-Xlint:-unchecked
-Xlint:-lossy-conversions
-Werror
diff --git a/src/main/java/com/thealgorithms/ciphers/ProductCipher.java b/src/main/java/com/thealgorithms/ciphers/ProductCipher.java
index fb63ed9b6..d7eaea757 100644
--- a/src/main/java/com/thealgorithms/ciphers/ProductCipher.java
+++ b/src/main/java/com/thealgorithms/ciphers/ProductCipher.java
@@ -68,7 +68,6 @@ final class ProductCipher {
System.out.println("Plaintext: ");
System.out.println(plaintext);
- sc.close();
}
}
}
diff --git a/src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java b/src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java
index a84a3ceff..522e19787 100644
--- a/src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java
+++ b/src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java
@@ -116,7 +116,6 @@ class BellmanFord /*
System.out.println();
}
}
- sc.close();
}
}
diff --git a/src/main/java/com/thealgorithms/datastructures/stacks/ReverseStack.java b/src/main/java/com/thealgorithms/datastructures/stacks/ReverseStack.java
index 0f9ef6f3a..84e9df96e 100644
--- a/src/main/java/com/thealgorithms/datastructures/stacks/ReverseStack.java
+++ b/src/main/java/com/thealgorithms/datastructures/stacks/ReverseStack.java
@@ -22,7 +22,6 @@ public final class ReverseStack {
for (i = 0; i < n; i++) {
stack.push(sc.nextInt());
}
- sc.close();
reverseStack(stack);
System.out.println("The reversed stack is:");
while (!stack.isEmpty()) {
diff --git a/src/main/java/com/thealgorithms/maths/NonRepeatingElement.java b/src/main/java/com/thealgorithms/maths/NonRepeatingElement.java
index f58a56aa0..5f1190d67 100644
--- a/src/main/java/com/thealgorithms/maths/NonRepeatingElement.java
+++ b/src/main/java/com/thealgorithms/maths/NonRepeatingElement.java
@@ -30,12 +30,6 @@ public final class NonRepeatingElement {
arr[i] = sc.nextInt();
}
- try {
- sc.close();
- } catch (Exception e) {
- System.out.println("Unable to close scanner" + e);
- }
-
// Find XOR of the 2 non repeating elements
for (i = 0; i < n; i++) {
res ^= arr[i];
@@ -55,7 +49,6 @@ public final class NonRepeatingElement {
}
System.out.println("The two non repeating elements are " + num1 + " and " + num2);
- sc.close();
}
}
/*
diff --git a/src/main/java/com/thealgorithms/others/InsertDeleteInArray.java b/src/main/java/com/thealgorithms/others/InsertDeleteInArray.java
index e4a9cbba4..a78bbbf34 100644
--- a/src/main/java/com/thealgorithms/others/InsertDeleteInArray.java
+++ b/src/main/java/com/thealgorithms/others/InsertDeleteInArray.java
@@ -47,7 +47,6 @@ public final class InsertDeleteInArray {
for (i = 0; i < size2 - 1; i++) {
System.out.println(b[i]);
}
- s.close();
}
}
}
diff --git a/src/main/java/com/thealgorithms/sorts/LinkListSort.java b/src/main/java/com/thealgorithms/sorts/LinkListSort.java
index daddae486..fdbfe3130 100644
--- a/src/main/java/com/thealgorithms/sorts/LinkListSort.java
+++ b/src/main/java/com/thealgorithms/sorts/LinkListSort.java
@@ -8,13 +8,10 @@
package com.thealgorithms.sorts;
import java.util.Arrays;
-import java.util.Scanner;
public class LinkListSort {
public static boolean isSorted(int[] p, int option) {
- try (Scanner sc = new Scanner(System.in)) {
- }
int[] a = p;
// Array is taken as input from test class
int[] b = p;