Activity Selection Problem using Greedy Method | Maximum Disjoint Intervals | DSA-One Course #96

[@AnujBhaiya]

At 11:30, the index positions inside the 2-D matrix are incorrect. The code and explanation is correct.

[@ridj41]

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.

[@sayantanacharya2040]

after watching ur greedy series i am greedy for more such greedy problems!👌

[@bartosz3667]

Kamedy

[@sanjaykbhagat2028]

Thanks, Easily able to understand.

[@grx4.067]

Anuj bhaiya or Love Babbar bhaiya are the best for dsa preparation thanks a lot bahiya for this

[@saritaprasad4295]

amazing explanation

[@gopichinthagumpula6481]

Bhai.. Please make a video on Spring boot

[@saritaprasad4295]

I will buy the coding shuttle course

[@justashushi]

Solution btao wai, kya timepass krare

[@premsagarkushwaha9207]

Awesome

[@blank1146]

I had to check my playback speed ..LOL

[@Abhishek-Khelge]

selecting min duration approach will fail

[@ayankhanra7910]

First bhiya

[@PriyanshGautam]

First ❤

[@VAIBHAVCHAUDHARY-zb3fu]

bhot bakwaas samjhaya bhai improve kar

[@shwetasingh3670]

Correct yaar

[@good114]

💕❤️❤️💕

[@nikhilpant2671]

waste of time