Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks.Tasks could be done without original order. Each task could be done in one interval. For each interval, CPU could finish one task or just be idle.

However, there is a non-negative cooling interval n that means between two same tasks, there must be at least n intervals that CPU are doing different tasks or just be idle. 

You need to return the least number of intervals the CPU will take to finish all the given tasks.

Example 1:

Input: tasks = ["A","A","A","B","B","B"], n = 2
Output: 8
Explanation: A -> B -> idle -> A -> B -> idle -> A -> B.



Note:

The number of tasks is in the range [1, 10000].
The integer n is in the range [0, 100].

Source: leetcode | Difficulty: MEDIUM_HARD
Tags: Sorting

Data structures

Mathematics

Greedy algorithms

Starter code: class Solution:
    def leastInterval(self, tasks: List[str], n: int) -> int:
        

Solutions:
class Solution:

	def leastInterval(self, tasks, n):
		if n == 0:
			return len(tasks)
		from collections import Counter
		counter = Counter(tasks)
		window = n + 1
		biggest_freq = max(list(counter.values()))
		num_of_max_freq = list(counter.values()).count(biggest_freq)
		return max(window * (biggest_freq - 1) + num_of_max_freq, len(tasks))


class Solution:

	def leastInterval(self, tasks, n):
		if not tasks:
			return 0
		counts = {}
		for i in tasks:
			if i in counts:
				counts[i] += 1
			else:
				counts[i] = 1
		M = max(counts.values())
		Mct = sum([1 for i in counts if counts[i] == M])
		return max(len(tasks), (M - 1) * (n + 1) + Mct)


class Solution:

	def leastInterval(self, tasks, n):
		(l, dic) = (len(tasks), {})
		for c in tasks:
			if c in dic:
				dic[c] += 1
			else:
				dic[c] = 1
		(m, a) = (max(dic.values()), 0)
		for c in dic:
			if dic[c] == m:
				a += 1
		return max(l, (m - 1) * (n + 1) + a)