solve Minimum Number of Pushes to Type Word I in java

Author: anishLearnsToCode

README.md

@@ -883,7 +883,7 @@
 | 3000 | [Maximum Area of Longest Diagonal Rectangle](https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle)                                                 |                                                                            [![Java](assets/java.png)](src/MaximumAreaOfLongestDiagonalRectangle.java)                                                                            |                                                                                                                                   |
 | 3005 | [Count Elements With Maximum Frequency](https://leetcode.com/problems/count-elements-with-maximum-frequency)                                                           |                                                                              [![Java](assets/java.png)](src/CountElementsWithMaximumFrequency.java)                                                                              |                                                                                                                                   |
 | 3010 | [Divide an Array Into Subarrays With Minimum Cost I](https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i)                                 |                                                                         [![Java](assets/java.png)](src/DivideAnArrayIntoSubarraysWithMinimumCostI.java)                                                                          |                                                                                                                                   |
-| 3014 | [Minimum Number of Pushes to Type Word I](https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i)                                                       |                                                                                                                                                                                                                                  |                                                                                                                                   |
+| 3014 | [Minimum Number of Pushes to Type Word I](https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i)                                                       |                                                                              [![Java](assets/java.png)](src/MinimumNumberOfPushesToTypeWordI.java)                                                                               |                                                                                                                                   |
 | 3019 | [Number of Changing Keys](https://leetcode.com/problems/number-of-changing-keys)                                                                                       |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 3024 | [Type of Triangle](https://leetcode.com/problems/type-of-triangle)                                                                                                     |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 3028 | [Ant on the Boundary](https://leetcode.com/problems/ant-on-the-boundary)                                                                                               |                                                                                                                                                                                                                                  |                                                                                                                                   |

src/MinimumNumberOfPushesToTypeWordI.java

@@ -0,0 +1,28 @@
+// https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i
+// T: O(|word|)
+// S: O(|word|)
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class MinimumNumberOfPushesToTypeWordI {
+    public static int minimumPushes(String word) {
+        final Map<Character, Integer> letterFrequency = getLetterFrequencies(word);
+        final var entries = letterFrequency.entrySet().stream().sorted((a, b) -> Integer.compare(b.getValue(), a.getValue())).toList();
+
+        int pushes = 0;
+        for (int i = 0 ; i < entries.size() ; i++) {
+            pushes += entries.get(i).getValue() * ((i + 8) / 8);
+        }
+
+        return pushes;
+    }
+
+    private static Map<Character, Integer> getLetterFrequencies(String s) {
+        final Map<Character, Integer> frequencies = new HashMap<>();
+        for (int i = 0 ; i < s.length() ; i++) {
+            frequencies.put(s.charAt(i), frequencies.getOrDefault(s.charAt(i), 0) + 1);
+        }
+        return frequencies;
+    }
+}