Capacity to Ship Packages Within D Days (LeetCode 1011) | Full Solution with visuals and animations

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

КОМЕНТАРІ • 11

  • @Satya-g5t
    @Satya-g5t 4 дні тому

    really very confident and good explanation with visuals, very cool. Your solution to this problem actually helps to solve similar other problems.

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

    Best approach

  • @jd1901-s
    @jd1901-s 3 місяці тому

    Good explanation but I would like you to use binary search in another function call which makes code cleaner and easy to understand...😇💯

  • @BABATUNDE-h7d
    @BABATUNDE-h7d 5 місяців тому +7

    Hey Nikhil please recommend me a DSA sheet

    • @jd1901-s
      @jd1901-s 3 місяці тому

      strivers AtoZ DSA playlist.....

  • @AshokKumar-sf1gn
    @AshokKumar-sf1gn 6 днів тому

    hey, why is it days is initialized to 1, (int days = 1), couldn't logically connect this. But this solution works fine.

  • @Homelander_30
    @Homelander_30 5 місяців тому +1

    Bro, collection framework lectures please?

  • @urvashichaurasia6284
    @urvashichaurasia6284 5 місяців тому +1

    Please make more video on interview questions

    • @nikoo28
      @nikoo28  4 місяці тому +1

      what questions are you looking for?

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

    Sir I've a better approach for this
    We can set the minimum value to the (maximum value/no of days)
    Because the range can better shorten by this logic.

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

      that is also a way to make things quicker. but the worst case time complexity will still remain the same :)