# Task Scheduler Idle Slots Formula (Practice 5079): Review

Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.

## Approach

Answer = max(len(tasks), (maxCount-1)*(n+1) + number of tasks tied at maxCount).

```python
from collections import Counter
def least_interval(tasks,n):
c=Counter(tasks).values();m=max(c)
return max(len(tasks),(m-1)*(n+1)+list(c).count(m))
```

## Complexity

Linear in the dominant input size for the scan; heap/tree variants add a log factor.

## Interview pitfalls

State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode.

## Practicing out loud

Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see try it free.