LeetCode | 621. Task Scheduler | Priority Queue

preview_player
Показать описание
Given a characters array tasks, representing the tasks a CPU needs to do, where each letter represents a different task. Tasks could be done in any order. Each task is done in one unit of time. For each unit of time, the CPU could complete either one task or just be idle.

However, there is a non-negative integer n that represents the cooldown period between two same tasks (the same letter in the array), that is that there must be at least n units of time between any two same tasks.

Return the least number of units of times that the CPU will take to finish all the given tasks.

#leetcode #dsa #priorityqueue #hashmap
Рекомендации по теме
Комментарии
Автор

Thank you so much, this was the most helpful video I could find on this topic!

tutkunazli
Автор

What will be the time complexity here?

priyankakataria
Автор

I'ts time complexity should be O(nlog(n))??

swatilohiya
Автор

sorry to say but please Improve your english its hard to understand in between

shreshthavbisht