Python Job Sequencing with Deadlines

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

Oct 02 '22 04:10 Sneha421

This is a problem that involves Greedy Approach. I have previously worked on this approach and would like to submit my work to this repository

Oct 02 '22 04:10 Sneha421

Hey.. Can you assign this problem to me

Oct 09 '22 17:10 Subhajit-Roy-O1

Hello, I am interested to solve this issue. Please assign it to me

Oct 11 '22 05:10 SusavanMondal

it would be great if i made my first pr by contributing to this, can you assign this to me

Oct 11 '22 16:10 deepakchowdary19

Please assign me this issue. I write a very understandable code.

Oct 26 '22 17:10 sushmita-2002