Notion SWE Interview Question 2025 March | Greedy and Heaps | on-campus

Question 1: 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 slots between two tasks with the same label. Return the minimum number of CPU intervals required to complete all tasks. Constraints 1 <= tasks.length <= ...