Minimum Number of Operations to Move All Balls to Each Box | LeetCode 1769 | Coders Camp

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

КОМЕНТАРІ • 7

  • @subramanyakrishna6018
    @subramanyakrishna6018 2 роки тому +2

    This is the best explainantion

  • @abhiram6087
    @abhiram6087 3 роки тому +2

    only thing bugging me in this video is how did you get the inspiration for that logic?

    • @CodersCamp
      @CodersCamp  3 роки тому +2

      Comes with practice :) There are few problems (like moving all chips to one position, distribute oranges to all members etc) deal with same kind of dynamic programming approach. If you understand how it actually works, you can tweak the solution for this kind of problems. Happy Learning!! :)

    • @abhiram6087
      @abhiram6087 3 роки тому +1

      @@CodersCamp it actually took 3hrs to solve this problem and after that i lost interest and I shutdown my laptop
      How much time is used to take to solve a problem for you when you were beginning ?
      How should I improve

    • @CodersCamp
      @CodersCamp  3 роки тому +1

      @@abhiram6087 Of course it took me more time as it took for you at the beginning, and i am still learning :) . You will improve as you practice more. if you want to learn dynamic programming, start with linear dp problems, and then move to two dimensional dp. You can check this playlist ua-cam.com/video/iq6sx1ki1ro/v-deo.html for more dp problems. I suggest instead of just understanding the pattern, try to learn how we are arriving at the logic. All the Best !

  • @kabiland2043
    @kabiland2043 3 роки тому

    really an amazing explanation.. the way you explained in a slow pace impressed me.. keep it up and please do more videos like this