Do daily

Author: Zanger67

my-submissions/m2145.py

@@ -0,0 +1,10 @@
+class Solution:
+    def numberOfArrays(self, differences: List[int], lower: int, upper: int) -> int:
+        minn, maxx = 0, 0
+        curr = 0
+
+        for dif in differences :
+            curr += dif
+            minn, maxx = min(minn, curr), max(maxx, curr)
+
+        return max(0, (upper - lower + 1) - (maxx - minn))

my-submissions/m781 oneliner.py

@@ -1,3 +1,3 @@
 class Solution:
     def numRabbits(self, answers: List[int]) -> int:
-        return sum((freqs + 1) * (ceil(x / (freqs + 1))) for freqs, x in Counter(answers).items())
+        return sum((freqs + 1) * (ceil(x / (freqs + 1))) for freqs, x in Counter(answers).items())