Optimal strategy for a game | Dynamic programming | Memoization | Love Babbar DSA sheet

Поділитися
Вставка
  • Опубліковано 12 вер 2024

КОМЕНТАРІ • 8

  • @Winnerloser12
    @Winnerloser12 2 роки тому

    even love babbar bhaiya ka video dekha but thoda thoda doubt tha and apka video dekhne ke baad full clear hai.Thanks a lot bhaiya.

  • @mrsmurf911
    @mrsmurf911 7 місяців тому

    Bhayya I have a doubt, Imagine this scenario
    P1:We took max element from first or last
    P2: Selects the max element from first or last
    P3: In the remaining array why we are keeping min(first,last), why not max cuz the opposite player already chosen max element from first or last, why we are again trying to take min element after opposite player chooses his element?

  • @radheshyamkumar289
    @radheshyamkumar289 2 роки тому +1

    Awesome bhai , nice explanation

  • @surajkumarsingh4857
    @surajkumarsingh4857 3 роки тому +1

    Keep going brother 💯💯

  • @siddharthb2226
    @siddharthb2226 2 роки тому +1

    THALAIVAAAAAAAAAA