Activity Selection Problem using Greedy Method | Maximum Disjoint Intervals | DSA-One Course #96
VloĆŸit
- Äas pĆidĂĄn 27. 07. 2024
- Hey guys, In this video, we will solve the activity selection problem using the Greedy Algorithm. This problem is also known as Maximum Disjoint Intervals.
Practice here: practice.geeksforgeeks.org/pr...
0:00 Introduction to Greedy Algorithm
2:16 Activity Selection Problem
7:56 Code
đ„ł Join our Telegram Community:
Telegram channel: telegram.me/realanujbhaiya
Telegram group: telegram.me/dsa_one
đ Follow me on:
Instagram: / anuj.kumar.sharma
Linkedin: / sharma-kumar-anuj
Twitter: / realanujbhaiya
đž Use coupon code ANUJBHAIYA on GeeksforGeeks to avail discounts on courses!
đ Complete DSA Playlist: âą DSA-One Course - The C...
Complete Android Development Playlist: âą Android Development Tu...
Hashtags:
#anujbhaiya #dsaone
Ignore these tags:
activity selection problem using greedy method
activity selection problem
greedy algorithm
activity selection
anuj bhaiya
greedy algorithms
activity selection problem greedy algorithm
activity selection problem using greedy algorithm
greedy approach
n meetings in one room
what is greedy algorithm
dsa
greedy
greedy method
interval scheduling greedy algorithm
algorithms
greedy algo
greedy algorithm adithya varma
greedy approach playlist
all kinds of greedy ways 4_vwwokpqpy
big 0 notation
big o notation in algorithm
disjoint intervals
disk scheduling
dsa one
greedy technique
job sequencing problem
maximum meetings in one room
shuffle an array
task selection algorithm
At 11:30, the index positions inside the 2-D matrix are incorrect. The code and explanation is correct.
Initially,I saw the code and was very confused, but after the dry-run the concept was very clear, I would recommend anyone who is currently preparing greedy, to wait see till the dry-run part of this video,even if they don't understand the code initially,once you get teh dry-run clearly,then the code is pretty easy to understand and implement by yourself.
after watching ur greedy series i am greedy for more such greedy problems!đ
Kamedy
Thanks, Easily able to understand.
amazing explanation
Anuj bhaiya or Love Babbar bhaiya are the best for dsa preparation thanks a lot bahiya for this
Awesome
Bhai.. Please make a video on Spring boot
I will buy the coding shuttle course
First bhiya
đâ€ïžâ€ïžđ
I had to check my playback speed ..LOL
First â€
Solution btao wai, kya timepass krare
selecting min duration approach will fail
bhot bakwaas samjhaya bhai improve kar
Correct yaar
waste of time