Find Pivot Index (LeetCode 724) | Full solution with constant space | Very important

Поділитися
Вставка
  • Опубліковано 10 січ 2025

КОМЕНТАРІ •

  • @Chandralekhachilumula
    @Chandralekhachilumula 2 місяці тому +1

    Your approach is amazing. I always look up to your videos to fully understand the problem and try to solve it on my own first. Can you put up some videos on Priority Queue?

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

      i will try to add them

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

    Superb explanation!

  • @HritikRaj-k6n
    @HritikRaj-k6n Місяць тому

    Great explanation sir

  • @AmitPandey-01
    @AmitPandey-01 2 місяці тому

    Crystal clear sir

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

    The same q was asked to me in Cimpress interview round, 3 days back😁😁

  • @tecboost8176
    @tecboost8176 2 місяці тому +1

    Sir when will system design video come❓

  • @AdityaChaurasia-o8m
    @AdityaChaurasia-o8m 2 місяці тому +1

    Nice video sir

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

    Its a nice solution, I used the stream API to sum the elements on the right in this way int rightSum = Arrays.stream(nums).sum()
    but it was not performing and when i changed to the normal for loop, it was performing well. I do not know why it was like that.

  • @CodingOnly-e6o
    @CodingOnly-e6o 2 місяці тому

    ❤❤❤