Job Sequencing with Deadlines #6510
Description
Problem Statement: Given 3 arrays - Job ID, Job Deadline and Job Profit, find all the non-overlapping jobs that give maximum profit. Only one job can be scheduled at a given time and each job takes one unit of time.
Input: Job ID, Job Deadline and Job Profit arrays [can be combined into one array as well]
Output: The number of jobs and the maximum profit
The above snippet has been taken from GeeksForGeeks