1937. Maximum Number of Points with Cost | Dynamic Programming | Leetcode Daily Challenge | JAVA

Поделиться
HTML-код
  • Опубликовано: 16 ноя 2024

Комментарии • 6

  • @pushpendrasingh777
    @pushpendrasingh777 3 месяца назад +6

    Can you explain it using a dry run so that people like me can get intuition behind it. You are directly writing the code which is not helping here!

    • @LeetQuest
      @LeetQuest  3 месяца назад +2

      Sure from tomorrow’s video we will do that ❤️. I will try my best. Thanks for your suggestions. It means a lot.

  • @digithk.v.8078
    @digithk.v.8078 3 месяца назад +1

    your example is wrong right? [[1,2,3,4],[2,5,1,3][3,5,1,7]] answer is 14 (4+3+7) all from same columns 4

    • @LeetQuest
      @LeetQuest  3 месяца назад +1

      Ohh yeah might be. It was not original test case I just took to explain the process so. Thanks for correction. I will take care of that next time.

  • @kunalyadav4361
    @kunalyadav4361 3 месяца назад

    Line 5 mein error show krr rha

    • @LeetQuest
      @LeetQuest  3 месяца назад

      We have to declare array long [] current = new long[col];