Course Schedule III | Live Coding with Explanation | Leetcode - 630

[@aditgandhi5065]

Brilliant Khushbu....... I really like your visualizations in every problem which makes it easy to understand. You made the hard problem very easy.

[@AlgorithmsMadeEasy]

Thanks

[@andresm-pf9ij]

Thank you teacher! I really appreaciate that smooth explanation of what is going on with this leetcode problem :)

[@AlgorithmsMadeEasy]

Glad you liked it !!

[@shauryatomer1058]

great video, thanks for the explanation

[@shivambhardwaj3273]

Very well explained! Thank you for making such amazing videos.

[@pironobcoding]

smoothest explaination thanks

[@RICHADASILA]

Great Work!!!

[@vedantagarwal22]

Great Explanation !!

[@AlgorithmsMadeEasy]

Thanks

[@dineshchintu9779]

Thanks mam !! helped a lot :) .

[@amritapandey7652]

Well explained !!

[@utkarshyadav3401]

A+++++ grade content mam!!!!

[@AlgorithmsMadeEasy]

Thanks 😀

[@anton.mikheyev]

thank you, relly clear explanation

[@praveenj3112]

Thanks for your approch & solution. I completely understood .

[@AlgorithmsMadeEasy]

Thanks

[@arushiarora5354]

Amazing explanation!! Thank you so much

[@rohitsatpute5518]

too amazing explanation

[@ssshukla26]

Very well explained. Thanks.

[@AlgorithmsMadeEasy]

You are welcome!

[@geek_for_life]

Great Explaination!👌🔥

[@ayushsinha4525]

Great solution and explanation

[@AlgorithmsMadeEasy]

Thanks

[@chintanpatel9304]

Amazing work

[@AlgorithmsMadeEasy]

Thanks !!

[@dsa3334]

Thaks mam

[@AlgorithmsMadeEasy]

Thanks

[@shiwani9146]

best explanation ,thank you so much ma'am !!

[@sidhuparas]

Awesome visualizations :)

[@rugvedb9842]

Thank you!

[@_justacoder_]

Thank you.. very helpful

[@AlgorithmsMadeEasy]

Glad it was helpful!

[@ektadhobley]

Amazing work! Thanks a lot

[@AlgorithmsMadeEasy]

Happy to help

[@narenmohan3426]

Can anyone tell me what is the mistake that I am making with my code? class Solution: def scheduleCourse(self, courses: List[List[int]]) -> int: courses.sort(key = lambda x:x[1]) maxindex = None output = [] currtime = 0 for i in range(len(courses)): if currtime + courses[i][0] courses[maxindex][0]: maxindex = i else: maxindex = i else: if maxindex is not None: if courses[i][0] < courses[maxindex][0]: #now we are interested in swapping with maxindex if (currtime + courses[i][0]) - courses[maxindex][0] < courses[i][1]: #it should also satisfy the above condition currtime -= courses[maxindex][0] output.remove(courses[maxindex]) output.append(courses[i]) currtime += courses[i][0] maxindex = i return len(output)

[@AlgorithmsMadeEasy]

You need to check where your swap is valid. That means if the duration of the course from output is higher than the current course.

[@heyrmi]

Great Explanation

[@AlgorithmsMadeEasy]

Thanks

[@venkatkrishna3774]

can't we do it in less time than nlogn? like O(n) or O(n+m). If we can avoid sorting, can we achieve better solution?

[@juda550]

This is amazing. Thank you so much!

[@kirtimanmishra8097]

awesome...

[@AlgorithmsMadeEasy]

Thanks!!

[@none8149]

I think in the else block we again have to check wether we can add the course or not

[@narenmohan3426]

Can anyone tell me what is the mistake that I am making with my code? class Solution: def scheduleCourse(self, courses: List[List[int]]) -> int: courses.sort(key = lambda x:x[1]) maxindex = None output = [] currtime = 0 for i in range(len(courses)): if currtime + courses[i][0] courses[maxindex][0]: maxindex = i else: maxindex = i else: if maxindex is not None: if courses[i][0] < courses[maxindex][0]: #now we are interested in swapping with maxindex if (currtime + courses[i][0]) - courses[maxindex][0] < courses[i][1]: #it should also satisfy the above condition currtime -= courses[maxindex][0] output.remove(courses[maxindex]) output.append(courses[i]) currtime += courses[i][0] maxindex = i return len(output)

[@hymnish_you]

Thank you very much

[@AlgorithmsMadeEasy]

Thanks

[@prakhargarg4166]

Thankyou

[@shubhamlahoti9758]

Could you also add explanation of dp approach for this problem ? Thank you for the explanation!

[@azeezmoiz9195]

sort the array based on increasing deadline and relate this problem to 0-1 knapsack, you will get it

[@dhanashreegodase4445]

thanks

[@rahulrajtripathi]

I am having a hard time understanding the Arrays.sort() line. It would be a kind gesture if someone can elaborate.

[@AlgorithmsMadeEasy]

It is a builtin method which sorts the array either with natural ordering or if a custom comparator is provided then with that.

[@gaunikasrivastava7851]

Is Time complexity=O(N log N) and space=O(N)? Correct me if I am wrong

[@ayushthakur2896]

Could you add time stamps to your video?

[@consistentthoughts826]

I tried without using Priority Queue then it is taking lot of time but it is accepted Can anyone explain why is it so?

[@narenmohan3426]

If you have used a variable to store the index of maximum value and using a list/array instead of a maxheap, then retrieving the value with the index will take time.

[@talwaarkidhaar]

Tum hi ho, Jo, Exam ko RAATEE laga laga ke pass karti ho...

[@nitishkumar-jh5qm]

best

[@AlgorithmsMadeEasy]

Thanks!!

[@deeksha6514]

This code is giving TLE on leetcode

[@SurajKumar-bw9oi]

Ye toh totally ratant vidya hai

[@dakshi5885]

hello mam can i contact u in any way?

[@aishwaryamali4350]

Very well explained

[@AlgorithmsMadeEasy]

Glad it was helpful!

[@santhiyaps]

Fantastic Explanation

[@AlgorithmsMadeEasy]

Thanks !!

[@JohnDoe-gn8gc]

Very good explanation thank you!

[@AlgorithmsMadeEasy]

Glad it was helpful!