Weighted Job Scheduling / Sequencing using Dynamic Programming

preview_player
Показать описание
Weighted Job Scheduling / Sequencing using Dynamic Programming.
There is start time and end time given for each job. You have to follow the deadline of each job.
Рекомендации по теме
Комментарии
Автор

at 16:43, it is 5+8 = 13 not 2 + 8 = 10 because you've calculated maximum profit earned by job C which is also compatible with job A. So, order will be A -> C-> F. Again, B->F is also a valid solution...thanks

ahsanulameensabit
Автор

sir during the exam time you came like a superhero and made my time optimal

ashutoshswar
Автор

Sir, at time 16:43 when j is at index 2 and i is at index 5, we are supposed to add 5 to 8 and not 2 to 8 because we have already calculated the maximum profit at index 2 which is 5 so sum will be 13(5+8). But anyway we already have 13 at position i so it will be programmers choice to take the recent updated value or keep it the same. if the programmer wishes to chose the recent updated value(5+8=13 when j is at index 2) then the jobs included in sequence will be a->c->f instead of b->f

rohitiyer
Автор

I have seen a lot of your videos.. and every one of them is awesome!!

DhananjayTyagi
Автор

Good Job Vivekanand!!! You will go a long way !

memevik
Автор

Sir I just wrote a code and its absolutely working

Vishal-ncju
Автор

Thank you Vivekanand! You did a great job explaining.

antuancaraballo
Автор

can you please post the code using the same approach you mentioned in video

DoubleTroubleStories
Автор

Sir your videos are very informative and engaging. Please tell us time complexity and space complexity of algorithms also. You make all hard concepts very easy to understand. Respect for you sir.

divyamgupta
Автор

how about a->c->f? shouldn't we use the summed up values in the new boxes while calculating for later jobs?

subhranil_mukherjee
Автор

Does this solution only gives best n jobs, where n <=2, which can be run into system at a time?

dablu
Автор

how do you get 3 jobs if they are compatible?

CrzyAsianGuy
Автор

Could you please tell me what is the reasoning behind sorting based on the end time, why not start time

Ggggggeyeyeurhuwue
Автор

Why do we need to sort the 2D array according to end time?? can you explain this??

satdhu
Автор

What if "end time" is unknown?

leftjabrighthook
Автор

can u plz explain median finding, Surfing lower Bounds, Closest pair and Closest Hull problems also using divide and conquer

shivaleelajoteppa
Автор

Awesome Explanation sir... Can we get code for this?

rishabhjain
Автор

What’s the real-time Application of weighted interval scheduling??

kp
Автор

Wrong! We have to use the box value while comparing.
Proof: Your method fails for the following example:
start = [0, 2, 9, 10, 11, 12]
end = [5, 9, 11, 11, 14, 17]
profit = [6, 9, 5, 3, 5, 6]
According to your method, the max profit is: 15
Actual profit: 9+5+6 = 20 for [(2, 9), (9, 11), (12, 17)]

captaindeadpool
Автор

How to sort 2D Array based on 2nd Column ? Please anyone explain .

VikashGupta-fmvk