239. Sliding Window Maximum II Monotonic Deque II Leetcode 239

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

КОМЕНТАРІ • 11

  • @akashvines0509
    @akashvines0509 9 місяців тому

    Thankyou bro, you explained the intuition very well, I didn't even require to see your solution and i had solved it ❤ keep up the good work

  • @dayashankarlakhotia4943
    @dayashankarlakhotia4943 Рік тому

    Good explanation with dryrun understood thanks

  • @Divyv520
    @Divyv520 Рік тому +2

    Hey Aryan , really nice video! I was wondering if I could help you edit your videos and also make a highly engaging Thumbnail which will help your video to reach to a wider audience .

  • @art4eigen93
    @art4eigen93 Рік тому

    Great explanation

  • @jamjam3448
    @jamjam3448 5 місяців тому

    Thanks bro. I solved it after your explanation without looking at the solution. Very happy

  • @poacher2865
    @poacher2865 4 місяці тому

    Why are we putting indexes in deque
    While you explained its elements itself you are adding in deque

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

    I think , in the priority queue approach, we do not have any find function for priority, but instead we can push the number and index as pair in priority queue and proceed , solving ,

  • @Algorithmswithsubham
    @Algorithmswithsubham Рік тому

    sir kuch beginers k lya v bana dijia please

  • @AJ-wf3wp
    @AJ-wf3wp Рік тому +2

    does not understand

    • @Gyooopp
      @Gyooopp Рік тому

      apni maa chuda fir mujhe kyu bol raha h

  • @RdxDada-c5h
    @RdxDada-c5h Рік тому

    Bohot window slide kari h lagta h😏