NeetCode #533LC-621MediumHeap / Priority QueueNC 150NC 250
← Back to All Problems#533 · #621 · Task Scheduler(任务调度器)
📌 Problem Statement & Constraints
You are given a list of CPU tasks (letters) and a cooldown
n. Identical tasks must be separated by at least n intervals; idle slots may be inserted. Return the minimum number of intervals needed to finish all tasks. Constraints: 1 <= tasks.length <= 10^4, 0 <= n <= 100.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!