LeetCode #1894 - Find the Student that Will Replace the Chalk

[ebanner]

Link to problem:

🟡 #1894 - Find the Student that Will Replace the Chalk

[ebanner]

class Solution:
    def chalkReplacer(self, chalk: List[int], k: int) -> int:
        rem = k % sum(chalk)
        for i, c in enumerate(chalk):
            if c > rem:
                return i
            rem -= c