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

SdĂ­let
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

Komentáƙe • 19

  • @AnujBhaiya
    @AnujBhaiya  Pƙed 2 lety +13

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

  • @ridj41
    @ridj41 Pƙed rokem +7

    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
    @sayantanacharya2040 Pƙed 2 lety +6

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

  • @sanjaykbhagat2028
    @sanjaykbhagat2028 Pƙed 11 měsĂ­ci

    Thanks, Easily able to understand.

  • @saritaprasad4295
    @saritaprasad4295 Pƙed rokem

    amazing explanation

  • @grx4.067
    @grx4.067 Pƙed 2 lety +2

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

  • @premsagarkushwaha9207
    @premsagarkushwaha9207 Pƙed 2 lety

    Awesome

  • @gopichinthagumpula6481
    @gopichinthagumpula6481 Pƙed 2 lety +1

    Bhai.. Please make a video on Spring boot

  • @saritaprasad4295
    @saritaprasad4295 Pƙed rokem +1

    I will buy the coding shuttle course

  • @ayankhanra7910
    @ayankhanra7910 Pƙed 2 lety +2

    First bhiya

  • @good114
    @good114 Pƙed rokem

    đŸ’•â€ïžâ€ïžđŸ’•

  • @blank1146
    @blank1146 Pƙed rokem

    I had to check my playback speed ..LOL

  • @PriyanshGautam
    @PriyanshGautam Pƙed 2 lety +1

    First ❀

  • @justashushi
    @justashushi Pƙed měsĂ­cem

    Solution btao wai, kya timepass krare

  • @Abhishek-Khelge
    @Abhishek-Khelge Pƙed 9 měsĂ­ci

    selecting min duration approach will fail

  • @VAIBHAVCHAUDHARY-zb3fu
    @VAIBHAVCHAUDHARY-zb3fu Pƙed rokem +11

    bhot bakwaas samjhaya bhai improve kar

  • @nikhilpant2671
    @nikhilpant2671 Pƙed rokem +5

    waste of time