- Trending Now
- Data Structures
- Algorithms
- System Design
- Foundational Courses
- Data Science
- Practice Problem
- Python
- Machine Learning
- Data Science Using Python
- Django
- DevOps
- JavaScript
- Java
- C
- C++
- ReactJS
- NodeJS
- Web Development
- Web Design
- Web Browser
- CP Live
- Aptitude
- Puzzles
- Projects
- DSA
- Design Patterns
- Software Development
- SEO
- Product Management
- SAP
- Programming
- Courses
- Tutorials
- DSA
- Data Science
- Web Tech
August 21, 2024 |90 Views
PROBLEM OF THE DAY : 11/08/2024 | Job Sequencing Problem
Save Share Like
Description
Discussion
Welcome to the daily solving of our PROBLEM OF THE DAY with Nitin Kaplas We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Dynamic Programming but also build up problem-solving skills.
Given a set of n jobs where each jobi has a deadline and profit associated with it.
Each job takes 1 unit of time to complete and only one job can be scheduled at a time. We earn the profit associated with a job if and only if the job is completed by its deadline.
Find the number of jobs done and the maximum profit.
Note: Jobs will be given in the form (Jobid, Deadline, Profit) associated with that Job. Deadline of the job is the time on or before which job needs to be completed to earn the profit.
Examples :
Input: Jobs = [[1,4,20],[2,1,1],[3,1,40],[4,1,30]]
Output: 2 60
Explanation: Job1 and Job3 can be done with maximum profit of 60 (20+40).
Give the problem a try before going through the video. All the best!!!
Problem Link: https://practice.geeksforgeeks.org/problems/job-sequencing-problem-1587115620/1
Recommendations
