#621
Task Scheduler
medium · 62.7% accepted · 11,751 likes · top 64%
array · hash table · greedy · sorting · heap (priority queue) · counting
Description
You are given an array of CPU tasks, each labeled with a letter from A to Z, and a number n. Each CPU interval can be idle or allow the completion of one task. Tasks can be completed in any order, but there's a constraint: there has to be a gap of at least n intervals between two tasks with the same label.
Return the minimum number of CPU intervals required to complete all tasks.
Solution