DoorDash OA Question 2024 June | Greedy | on-campus

Question: Task Scheduler Problem Statement 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 is a cooldown interval of n intervals between two tasks with the same label. Return the minimum number of CPU intervals required to finish all the given tasks. Constraints 1 <= tasks.length ...