diff --git a/spotbugs-exclude.xml b/spotbugs-exclude.xml
index 0a535438..9a9712e0 100644
--- a/spotbugs-exclude.xml
+++ b/spotbugs-exclude.xml
@@ -132,9 +132,6 @@
     <Match>
         <Bug pattern="USBR_UNNECESSARY_STORE_BEFORE_RETURN" />
     </Match>
-    <Match>
-        <Bug pattern="SPP_USE_ISEMPTY" />
-    </Match>
     <Match>
         <Bug pattern="BL_BURYING_LOGIC" />
     </Match>
diff --git a/src/main/java/com/thealgorithms/devutils/nodes/LargeTreeNode.java b/src/main/java/com/thealgorithms/devutils/nodes/LargeTreeNode.java
index 1575e364..95d53ecb 100644
--- a/src/main/java/com/thealgorithms/devutils/nodes/LargeTreeNode.java
+++ b/src/main/java/com/thealgorithms/devutils/nodes/LargeTreeNode.java
@@ -64,7 +64,7 @@ public class LargeTreeNode<E> extends TreeNode<E> {
      */
     @Override
     public boolean isLeafNode() {
-        return (childNodes == null || childNodes.size() == 0);
+        return (childNodes == null || childNodes.isEmpty());
     }
 
     public Collection<LargeTreeNode<E>> getChildNodes() {
diff --git a/src/main/java/com/thealgorithms/searches/QuickSelect.java b/src/main/java/com/thealgorithms/searches/QuickSelect.java
index c89abb00..d5f69529 100644
--- a/src/main/java/com/thealgorithms/searches/QuickSelect.java
+++ b/src/main/java/com/thealgorithms/searches/QuickSelect.java
@@ -31,7 +31,7 @@ public final class QuickSelect {
     public static <T extends Comparable<T>> T select(List<T> list, int n) {
         Objects.requireNonNull(list, "The list of elements must not be null.");
 
-        if (list.size() == 0) {
+        if (list.isEmpty()) {
             String msg = "The list of elements must not be empty.";
             throw new IllegalArgumentException(msg);
         }
diff --git a/src/main/java/com/thealgorithms/sorts/MergeSortRecursive.java b/src/main/java/com/thealgorithms/sorts/MergeSortRecursive.java
index f67ba631..910157b8 100644
--- a/src/main/java/com/thealgorithms/sorts/MergeSortRecursive.java
+++ b/src/main/java/com/thealgorithms/sorts/MergeSortRecursive.java
@@ -34,13 +34,13 @@ public class MergeSortRecursive {
     }
 
     private static List<Integer> sort(List<Integer> unsortedA, List<Integer> unsortedB) {
-        if (unsortedA.size() <= 0 && unsortedB.size() <= 0) {
+        if (unsortedA.isEmpty() && unsortedB.isEmpty()) {
             return new ArrayList<>();
         }
-        if (unsortedA.size() <= 0) {
+        if (unsortedA.isEmpty()) {
             return unsortedB;
         }
-        if (unsortedB.size() <= 0) {
+        if (unsortedB.isEmpty()) {
             return unsortedA;
         }
         if (unsortedA.get(0) <= unsortedB.get(0)) {