2028. Find Missing Observations (Medium) - TengnanYao/daily_leetcode GitHub Wiki

class Solution:
    def missingRolls(self, rolls: List[int], mean: int, n: int) -> List[int]:
        m = len(rolls)
        diff = mean * (m + n) - sum(rolls)
        if diff > 6 * n or diff < n:
            return []
        div, mod = divmod(diff, n)
        return [div + 1] * mod + [div] * (n - mod)