Job Sequencing Problem (Greedy Algorithm) | GeeksforGeeks

[@kausikhm]

Thanks to this I passed my exam!!!

[@abhinavs03]

Abe

[@siddhartharaja9413]

Bahut bhadiya

[@TheMightyBean321]

Watching a few of your videos and in this one it seems like you are talking as if to not wake up someone sleeping next to you. You can still hear everything clearly, but I just thought it was kinda funny. Thanks for the video :)

[@utkarshankit]

so what is the difference remains between job sequencing problem and activity selection problem??

[@skewbinge6157]

these videos are good but you should consider raising the voice either nt the mic options or when editing the video

[@vatsalmankodi9050]

Thank You for such videos. Hoping for many such helpful tutorials form GeeksForGeeks.

[@GeeksforGeeksVideos]

You're welcome, Vatsal. :)
More tutorials are on the way. Stay tuned.

[@VijayReddyV]

Vatsal Mankodi kcr

[@aditigupta6870]

Time complexity should be O(nlogn+n*T) right and SC should be O(T) and not O(n) but its written in article O(n)?

[@AB-iv4bq]

they have assumed the profit array to be sorted already ,that is why order of n

[@angshukNag]

Will Greedy method work for this (profit, deadline) tuple set ? .... { (5, 1) , (33, 4), (35, 4), (37, 4) }?

[@shubhamjain54519]

I am getting time limit exceeded with this approach

[@snehah1629]

Thanks a lot. I have a doubt can we allot job A in the time slot from 0-1 ?

[@kartikpeddinti487]

abhishek kumar lol

[@swarajya.jadhav]

What an explanation! ;)

[@jdragon8184]

its very cringy for me cuz i just completed dynamic p , but i thought why do a job if it can be delayed

[@santoshr4212]

Volume is too too low.

[@sayantangupta1403]

You People are doing an excellent job. Keep it up. If you need any help, just let me know dear.

[@GeeksforGeeksVideos]

Thanks Sayantan. Liking and sharing our videos and subscribing to our channel would really help!

[@sheetalmor9048]

would you please explain the Sort ( arr,arr+n,comparison ) function

[@GeeksforGeeksVideos]

It is the STL sort function. You can learn about it here: www.geeksforgeeks.org/sort-c-stl/

[@yogeshyewale478]

Voice is very low

[@tswfootball]

This is good, but you should explain how you can be sure this is the optimal solution.

[@anantsingh7106]

greedy is always sub-optimal

[@jayturakhia2261]

Not always. It may generate optimal as well

[@TheIshaan94]

I love your videos but the volume is so low.

[@GeeksforGeeksVideos]

Thanks for the feedback. We'll share this with the contributor.

[@mahabirsaha5777]

Greatly explained !!!

[@satadhi]

this is 2017, why cant you guys make videos in 720p ? btw these videos are awesome! to the point and human friendly

[@GeeksforGeeksVideos]

Thanks for the feedback. We will convey this and the appreciation to our contributor. :)

[@mohamedbashir7797]

Can this question be done at O(n) ?

[@leapingquark]

I think O(n) is not possible but you can optimize it to execute in O(nlog(n)) time if you use binary search instead of searching linearly. Hope that helps 😃

[@Programming-mind]

Nice explanation 👍
Thnx

[@23ritik]

please add java codes to all problems

[@sarthakkumar856]

Really great explanation :D

[@SonuSonu-tk5pk]

very clear and neat explanation
Thanks very much

[@GeeksforGeeksVideos]

Thanks Sonu :)

[@vamsikumar93477]

Thanku for nice explanation

[@f4lld4ark3]

Very inteligente Man…..muito inteligente senhor e muita qualidade muito respeito

[@GeeksforGeeksVideos]

Thanks a lot :)

[@thetruereality2]

i didnt get you at 2:55

[@maruf7956]

The description box lol illuminati confirmed

[@SuperBhavanishankar]

omg yes :O

[@ketan_sahu]

awesome explanation!!!

[@alieser7770]

why is this greedy? isn't it always the optimal solution?

[@harshitagrawal2044]

Greedy algorithms too give optimal solutions quite often!
It is basically the most optimal solution at the current time which when done each time, turns out to be optimal for the whole problem

[@AkashRaj-ib6wz]

Sets can help us to do it nlogn 🤔

[@tithidutta2879]

how u can find the time complexity...?? nd can u make a video over HOW TO PROOF THAT A GREEDY ALGORITHM ALWAYS FIND AN OPTIMAL SCHEDULE??? it's really very very urgent...plzz reply if u can...

[@HeroicHaroon]

Thanks a ton

[@simranc9773]

Plz include d code in C as well

[@achin4140]

i beg you please tell about TSP using Greedy Approach,Please explain about Hamilatrian circuit or cycle in this and also tell how to solve TSP using Nearest Neighbour Aprroach (NN approach ) and also Shortest Edge approach(SE ) and also tell how to find the weighted Adjacency Matrix and how to solve TSp please i am crying i am not understanding please tell sir please

[@GeeksforGeeksVideos]

Hi Achin,
We have these topics on our list and will be covering them in the coming weeks.

[@kapboom_9432]

Shedule? ok..

[@anthonybacena2850]

I cant see the whole statement bec. Of your subtitle but thank you

[@kurtweynegaso9773]

SHEDULING

[@niteshhebbare3339]

Thanks sir

[@GeeksforGeeksVideos]

Thanks Nitesh Hebbare :)

[@neerajchoudhary3709]

bhai tum khud gfg ho, kya bol rahe ho

[@ChetturuKhaleel-h5p]

Who are watching this in 2024

[@kashifakhursheed1350]

speak a bit louder

[@suraj2085]

Thanks!

[@GeeksforGeeksVideos]

You're welcome Akatsuki!

[@Ms9999Christina]

all praise illuminati

[@SuperBhavanishankar]

hahaha hail illuminati lol