In this video we will learn about Job Sequencing Problem with Deadline.
CODE LINK: [ Ссылка ]

This problem consists of n jobs each associated with a deadline and profit and our objective is to earn maximum profit. We will earn profit only when job is completed on or before deadline. We assume that each job will take unit time to complete.

Algorithm Playlist
[ Ссылка ]

Data Structure Playlist
[ Ссылка ]

Heap Sort
[ Ссылка ]

Quick Sort
[ Ссылка ]

Radix Sort
[ Ссылка ]

Shell Sort
[ Ссылка ]

Counting Sort
[ Ссылка ]

if you find my videos interesting and enjoy watching them then please give a thumbs up, share and subscribe my channel and comment.

click the following link to subscribe my channel
[ Ссылка ]

thanks for watching
see you in the next video
stay happy and keep smiling :-)

свернуть