Task Scheduler at DE Shaw
Medium62.6% acceptance
This problem has 37.5% frequency at DE Shaw.
Problem 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 wit...
Read full problem and hintsTopics
Also asked at 29 companies
More DE Shaw Questions
Find Minimum Cost to Remove Array ElementsMediumLetter Combinations of a Phone NumberMediumMaximum Points After Collecting Coins From All NodesHardRelative Sort ArrayEasyMaximum Strength of K Disjoint SubarraysHard
View all DE Shaw questions