Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C#

Solution: Schedule Tasks on Minimum Machines

Understand how to solve the scheduling problem by using a min heap to track task end times and allocate machines efficiently. Learn to minimize the number of machines required by reusing available ones, improving your coding interview skills in handling interval-based tasks.

We'll cover the following...

Statement

We are given an input array, tasks, where tasks[i] =[starti,endi]= [start_i, end_i] represents the start and end times of nn tasks. Our goal is to schedule these tasks on machines given the following criteria:

  1. A machine can execute only one task at a time.

  2. A machine can begin executing a new task immediately after completing the previous one.

  3. An unlimited number of machines are available.

Find the minimum number of machines required to complete these ...