Job sequencing problem with deadline | Greedy Method | Design & Algorithms | Lec-39 | Bhanu Priya

[@maheshadhimulam3074]

i cleared many backlogs by seeing uh r vedios mam...tq so much..❤

[@pravallika5f462]

Bro algorithm pseudocode loney rayala?

[@jarpulaashok5780]

@@pravallika5f462 may be

[@harshanchinthala5618]

@@pravallika5f462 ledu pseudo code algorithm seperate ga raayali

[@vamshireddy8740]

Paid Haa broo

[@hitman-oo9dc]

@@vamshireddy8740

[@MedicalWizardry]

Videos are superb and understandable, but Please adjust your camera ma'am or adjust your papers accordingly.

[@sujan_kumar_mitra]

why the minimum of dmax and deadline[i] ????

[@anjumsadvice]

Thanks a lot mam...

[@Ellenki_007]

U done great job and I love ur voice

[@saisravani2625]

Mam Why we want to take k=min(dm ,di) , we can directly take k=di; Could u pls tell mam?

[@sandippal8908]

Same question 🤔

[@subhradipbarik2032]

minimize lecture time and give clear explanation . While watching I felt may be u don't have a clear idea

[@AditiShetkar]

ua-cam.com/video/sPAqQ5mOv08/v-deo.html

[@saikumarreddy5878]

Correct

[@GoliBodhini]

Nice .🎉

[@PubgBeginers]

Mam advanced algorithms &design and algorithms are same

[@samitshivadekar5096]

what is time complexity ?

[@anjumsadvice]

O(n2)

[@MaheshGouni]

what is the use of look at a2 a1 a3

[@bharath7655]

How to find time complexity for this

[@bharath7655]

O(n^2) how it is come for this method

[@VikasKumar-ki7zy]

Madam your Concept are not clear 😕

[@cvismenu]

Thank you

[@sivakrishnadasari7470]

please share python implementation of above algorithm

[@mayasavant3672]

Ag Bai pen change krt bsnya peksha lavkar lavkar explain kr ki baii

[@CareerHirings]

thx

[@youtubenews9874]

Where is tree vertex spiliting

[@diwakaranand1449]

So much confusioning mam

[@hetvishah926]

Very bad explain

[@vinaykumar5791]

are you tamilian?

[@robertaaron7905]

WORST EXPLANATION EVER