Runtime: 3172 ms (Top 17.12%) | Memory: 25 MB (Top 17.51%)

Author: AnasImloul

scripts/algorithms/F/Find Missing Observations/Find Missing Observations.py

@@ -1,3 +1,5 @@
+# Runtime: 3172 ms (Top 17.12%) | Memory: 25 MB (Top 17.51%)
+
 class Solution:
     def missingRolls(self, rolls: List[int], mean: int, n: int) -> List[int]:
         missing_val, rem = divmod(mean * (len(rolls) + n) - sum(rolls), n)
@@ -6,4 +8,4 @@ def missingRolls(self, rolls: List[int], mean: int, n: int) -> List[int]:
                 return [missing_val] * n
         elif 1 <= missing_val < 6:
             return [missing_val + 1] * rem + [missing_val] * (n - rem)
-        return []
+        return []