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 0321f23b2f65..5424e14c72fd 100644
--- a/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MajorityElement.java
+++ b/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MajorityElement.java
@@ -19,8 +19,7 @@ This method returns the majority element(s) in the given array of integers.
     public static List<Integer> majority(int[] nums) {
         HashMap<Integer, Integer> numToCount = new HashMap<>();
         for (final var num : nums) {
-            final var curCount = numToCount.getOrDefault(num, 0);
-            numToCount.put(num, curCount + 1);
+            numToCount.merge(num, 1, Integer::sum);
         }
         List<Integer> majorityElements = new ArrayList<>();
         for (final var entry : numToCount.entrySet()) {