3117. Minimum Sum of Values by Dividing Array | Weekly Leetcode 393

Sdílet
Vložit
  • čas přidán 5. 09. 2024

Komentáře • 9

  • @sanjai_rs7
    @sanjai_rs7 Před 4 měsíci +9

    Even though While having a full time job, you are so consistent. Just imagine how much discipline and consistent this guy would have when he was an UG student.🗿

  • @miketsubasa3611
    @miketsubasa3611 Před 4 měsíci

    Excellent explanation!!🦸

  • @purushotamkumar9596
    @purushotamkumar9596 Před 4 měsíci +1

    Thanks for such video. Learned many things from this video

  • @SahilKumar-sj6il
    @SahilKumar-sj6il Před 4 měsíci

    Sir why we are not iteratiing from P--0 in parts in iterative?Can we iterate that way?

  • @NeerajSharma-mz4es
    @NeerajSharma-mz4es Před 4 měsíci

    nice explanation

  • @iWontFakeIt
    @iWontFakeIt Před 4 měsíci +1

    oh man! was waiting for this from morning! tried understanding several approaches using binary search but none of the solutions in the discuss section were good. 🫤
    also please share the segment tree code for bottom up please 🙏

    • @codingmohan
      @codingmohan  Před 4 měsíci

      I would encourage you to try that first and if you face issues, I can help further.

    • @iWontFakeIt
      @iWontFakeIt Před 4 měsíci

      @@codingmohan i tried for past two days, but couldn't figure out! please tell the approach of applying segment trees to this problem!

    • @codingmohan
      @codingmohan  Před 4 měsíci

      There are 2 parts where you can utilize segment trees here -
      1. Finding out L and R for the top down solution.
      2. Finding out range max in range L to R in the bottom up solution.
      Did you understand these 2 parts atleast?