LeetCode 2519. Count the Number of K-Big Indices - Amazon Interview Question

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

КОМЕНТАРІ • 7

  • @lbigolEdawgl
    @lbigolEdawgl 2 місяці тому

    This was very helpful. The way that you step through and explain why certain things were done really helps to understand the bigger picture. Keep it up!!

  • @AA-lo1kx
    @AA-lo1kx 5 місяців тому

    Underated channel, you deserve more subs.
    Wow, a LeetCode "Hard" explained in 10 mins and its super clear.
    Great explanation, because of you, it feels like a "Medium".

  • @mahletlulseged4858
    @mahletlulseged4858 6 місяців тому

    Great explanation! Thank you so much!

  • @firezdog
    @firezdog Місяць тому

    it seemed like a monotonic stack worked from right to left -- was really hoping it would also work from left to right

  • @yashaa100
    @yashaa100 11 місяців тому

    This explanation was super helpful! Thank you! 😀Could you please mention the time and space complexity for it?

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

    My first throught is using Binary Index Tree

  • @sinamon6296
    @sinamon6296 8 місяців тому

    Thankyou