LC-0621 Medium LeetCode

621. Task Scheduler

Array Hash Table Greedy Sorting Heap (Priority Queue) Counting

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 61% Topics: Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting

Reading material

Arrays & Hashing 12 min Greedy 11 min Sorting 13 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(26) = O(1)

from collections import Counter


class Solution(object):
    def leastInterval(self, tasks, n):
        """
        :type tasks: List[str]
        :type n: int
        :rtype: int
        """
        counter = Counter(tasks)
        _, max_count = counter.most_common(1)[0]
        return max((max_count-1) * (n+1) + counter.values().count(max_count), len(tasks))

Solution from kamyu104/LeetCode-Solutions · MIT