diff --git a/spotbugs-exclude.xml b/spotbugs-exclude.xml
index f621c84dd4bf..ffafa51e76ed 100644
--- a/spotbugs-exclude.xml
+++ b/spotbugs-exclude.xml
@@ -68,9 +68,6 @@
     <Match>
         <Bug pattern="IM_BAD_CHECK_FOR_ODD" />
     </Match>
-    <Match>
-        <Bug pattern="WMI_WRONG_MAP_ITERATOR" />
-    </Match>
     <Match>
         <Bug pattern="DM_BOXED_PRIMITIVE_FOR_PARSING" />
     </Match>
diff --git a/src/main/java/com/thealgorithms/datastructures/graphs/KahnsAlgorithm.java b/src/main/java/com/thealgorithms/datastructures/graphs/KahnsAlgorithm.java
index 145071890d76..be83ea32f496 100644
--- a/src/main/java/com/thealgorithms/datastructures/graphs/KahnsAlgorithm.java
+++ b/src/main/java/com/thealgorithms/datastructures/graphs/KahnsAlgorithm.java
@@ -54,19 +54,6 @@ ArrayList<E> getAdjacents(E v) {
     Set<E> getVertices() {
         return adj.keySet();
     }
-
-    /**
-     * Prints the adjacency list
-     */
-    void printGraph() {
-        for (E vertex : adj.keySet()) {
-            System.out.print(vertex + " : ");
-            for (E adjacent : adj.get(vertex)) {
-                System.out.print(adjacent + " ");
-            }
-            System.out.println();
-        }
-    }
 }
 
 class TopologicalSort<E extends Comparable<E>> {
@@ -104,9 +91,9 @@ ArrayList<E> topSortOrder() {
         calculateInDegree();
         Queue<E> q = new LinkedList<E>();
 
-        for (E vertex : inDegree.keySet()) {
-            if (inDegree.get(vertex) == 0) {
-                q.add(vertex);
+        for (final var entry : inDegree.entrySet()) {
+            if (entry.getValue() == 0) {
+                q.add(entry.getKey());
             }
         }
 
diff --git a/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MajorityElement.java b/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MajorityElement.java
index bfa5759a41b9..56d2b0ef930c 100644
--- a/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MajorityElement.java
+++ b/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MajorityElement.java
@@ -27,9 +27,9 @@ public static List<Integer> majority(int[] nums) {
             }
         }
         List<Integer> majorityElements = new ArrayList<>();
-        for (int key : numToCount.keySet()) {
-            if (numToCount.get(key) >= n / 2) {
-                majorityElements.add(key);
+        for (final var entry : numToCount.entrySet()) {
+            if (entry.getValue() >= n / 2) {
+                majorityElements.add(entry.getKey());
             }
         }
         return majorityElements;
diff --git a/src/main/java/com/thealgorithms/maths/Mode.java b/src/main/java/com/thealgorithms/maths/Mode.java
index a92f404c653a..f0b747cf02ec 100644
--- a/src/main/java/com/thealgorithms/maths/Mode.java
+++ b/src/main/java/com/thealgorithms/maths/Mode.java
@@ -38,9 +38,9 @@ public static int[] mode(final int[] numbers) {
         int max = Collections.max(count.values());
         ArrayList<Integer> modes = new ArrayList<>();
 
-        for (int num : count.keySet()) {
-            if (count.get(num) == max) {
-                modes.add(num);
+        for (final var entry : count.entrySet()) {
+            if (entry.getValue() == max) {
+                modes.add(entry.getKey());
             }
         }
         return modes.stream().mapToInt(n -> n).toArray();