3381. Maximum Subarray Sum With Length Divisible by K | Prefix Sums | Arrays | Handling Mod & Length

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

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

  • @AnirudhSingh-y8q
    @AnirudhSingh-y8q 8 дней назад +9

    Worst explanation

  • @NeverLoose-v5i
    @NeverLoose-v5i 4 дня назад

    very nice solution

  • @ShivamSingh-xv4rw
    @ShivamSingh-xv4rw 8 дней назад +1

    Awesome explanation ❤❤🎉

  • @lakshmisaichaitanyarajapu9313
    @lakshmisaichaitanyarajapu9313 8 дней назад +2

    Hi Aryan, thankyou for creating content on LC, Small suggestion, explanations can be bit clearer, slower.While explaining, you are assuming that viewers know certain things, but not everyone has intensly practiced and well versed as you, please be more elaborative..
    Thankyou

  • @saumyaagarwal7
    @saumyaagarwal7 6 дней назад

    bhai amazing solution

  • @AkshithReddy-w9p
    @AkshithReddy-w9p 8 дней назад +2

    First comment

  • @ajayc815
    @ajayc815 8 дней назад +1

    🥰🥰🥰🥰🥰

  • @Ayush37262
    @Ayush37262 4 дня назад +2

    Very Poor Explanation 👎

  • @yashwairagade3677
    @yashwairagade3677 8 дней назад +1

    Can we expect today's D?

  • @it-i064vamsi8
    @it-i064vamsi8 8 дней назад

  • @vishalgadade1585
    @vishalgadade1585 5 дней назад

    Bhai,woh minimize kyon Krna ache se nhi smjha,the reason that you like,let's say something but begginer student facing difficulties to understand this concept please explain everything clearly don't use words like let's say something