LeetCode 621 Task Scheduler - Why Naive Fails

Try every possible ordering of tasks using backtracking.

With $n$ tasks, there are potentially $n!$ orderings. Even with pruning, this explodes for large inputs.

Can you compute the answer without simulating every schedule?