Problem - Task Scheduler

Tasks with cooldown: same task must have at least $n$ intervals between executions. Find minimum time to complete all tasks. Example: tasks = [A,A,A,B,B,B], n = $2$. One schedule: A B idle A B idle A B. Time: $8$. The most frequent task determines the minimum time.