Select maximum tasks before deadlines

Q: Select maximum tasks before deadlines

This question evaluates a candidate's competence in scheduling and greedy algorithm design, including understanding of time-based constraints, efficient data-structure use, and reasoning about correctness.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are given a set of tasks, each with a positive duration and a deadline (lastDay). You may schedule tasks in any order but only one at a time. Find the maximum number of tasks you can complete such that each chosen task finishes by its deadline. Return the count and describe an O(n log n) algorithm and its correctness intuition.

Select maximum tasks before deadlines

Overview

Comments (0)