Task scheduler with a cooldown between identical tasks

Given a list of tasks (letters) and a cooldown n, identical tasks must be at least n time units apart; the CPU can idle. Return the fewest time units to run them all. Solve it with a counting formula or a max-heap simulation.