daily

Author: Zanger67

my-submissions/m3016 v1.py

@@ -0,0 +1,9 @@
+class Solution:
+    def minimumPushes(self, word: str) -> int:
+        cnt = sorted([f for f in Counter(word).values()])
+        output = 0
+
+        for i in range(len(cnt)) :
+            output += cnt[-i - 1] * (ceil((i + 1) / 8))
+        
+        return output

my-submissions/m3016 v2 Oneliner.py

@@ -0,0 +1,3 @@
+class Solution:
+    def minimumPushes(self, word: str) -> int:
+        return sum([x * ceil(i / 8) for i, x in enumerate(sorted([f for f in Counter(word).values()], reverse=True), 1)])