L6. Job Sequencing Problem | Greedy Algorithm Playlist

Find problem link, notes here: takeuforward.org/strivers-a2z...
Follow me on socials: linktr.ee/takeUforward

[@priyadarsimishra7909]

There is a slight error in the code. The inner for loop should start from j = deadline (arr[I].dead) till j >= 1 not 0. Because otherwise we are adding arr[0] but there is no day 0 to do work

[@optimus_prime01]

ok

[@samitkumar18]

String please 🙏

[@adarshmv261]

Day 0 or Time 0 should not be considered... As per the prob in GFG !!!

[@siddharthchaudhary2320]

Thank you striver for the yet another wonderful explanation.
If anyone can tell how we can reduce the time complexity of internal loop to O(1) using DSU , please explain the logic. Thank you

[@Dsa_kabaap]

Sir please start making videos on strings and stacks

[@parthapratimhalder4888]

One thing I cannot understand why array of size 7 is taken where as max deadline is 6!!??

[@anubhav0355]

for a job with deadline 6, you will put it into hash[6] right? so size of hash must be 7 for it to have 6 as valid index!

[@animexworld6614]

Slightly mis typed Error in code It will be hash[ j ] = arr[i].jobid ... it will be hash of j not i

[@KartikeyTT]

tysm sir

[@prathameshjadhav2942]

Understood

[@user-iu3yl3hp8y]

Bhaiya, Strings aur Stack and Queue ki playlist kab laoge

[@valiz2628]

❤

[@adarshjaiswal7334]

What is the concept of day0? The day should start with 1 right?

[@divy04]

same doubt

[@priyadarsimishra7909]

I think it is to avoid like the deadline - 1 when changing value in hash, but the inner for loop should go from j = deadline to j >= 1 not till 0 because otherwise the output is not correct. I believe that is the error.

[@nitjsrstudent5423]

@@priyadarsimishra7909 yeah u r correct

[@World-Of-Mr-Motivater]

striver ingeneral when speaking in an interview ,will you speak in 1.5x or 1 x speed?

[@achalsayee2534]

🤣😂

[@user-id9gq8op6t]

can you please change the song that you have added at the end of each video.....

[@sumitmishra9795]

00:04 Solve job sequencing problem to maximize profit.
02:15 Maximize profit by scheduling jobs with deadlines efficiently
04:25 Maximize profit by scheduling jobs within deadlines.
06:21 Maximizing profit by scheduling jobs based on deadlines.
08:19 Job sequencing problem solved using Greedy Algorithm
10:09 Understanding the comparator logic and sorting based on profit in job sequencing problem
12:17 Iterating through jobs to maximize profit
14:17 Optimizing job sequencing problem complexity and space

[@anshulsharma3137]

Hi Striver, we can even use priority queue to optimize, basically choose only the maximum profit job from the jobs with the same deadline.

[@dumpster-jackson]

That will add extra O(n) space -> priority queue. Hence sorting will be better

[@anshulsharma3137]

@@dumpster-jackson I have given the priority queue approach to further optimize the sorting solution from O(n*n) to O(n*logn) bro. Instead of using Dsu we can use priority queue to approach

[@dumpster-jackson]

@@anshulsharma3137 Good approach!!

[@Professor-du2pf]

cout

[@viveknandan4950]

you forget to put ;

[@Carson00_11]

Hello baby 🤗

[@lofi_feels1924]

💀💀

[@anuragmandal3136]

really cant understand anything he says

[@adarshjaiswal7334]

You definetly will, Just don't quit for next 22 days!!