Greedy Algorithm | Activity Selection Problem - step by step guide

In this video we will learn about Activity Selection Problem, a greedy way to find the maximum number of activities a person or machine can perform, assuming that the person or machine involved can only work on a single activity at a time. CODE LINK: https://www.dyclassroom.com/greedy-algorithm/activity-selection-problem Algorithm Playlist https://www.youtube.com/playlist?list=PLG6ePePp5vvYVEjRanyndt7ZSqTzillom Data Structure Playlist https://www.youtube.com/playlist?list=PLG6ePePp5vvbSpe0TuFxRwC6YT66Ty8Vx Heap Sort https://www.youtube.com/watch?v=51JGP4VVlDc Quick Sort https://www.youtube.com/watch?v=3OLTJlwyIqQ Radix Sort https://www.youtube.com/watch?v=YXFI4osELGU if you find my videos interesting and enjoy watching them then please give a thumbs up, share and subscribe my channel and comment. click the following link to subscribe my channel https://www.youtube.com/user/yusufshakeel?sub_confirmation=1 thanks for watching see you in the next video stay happy and keep smiling :-)