3352. Count K-Reducible Numbers Less Than N | Digit DP + 1D DP

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

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

  • @ARYANMITTAL
    @ARYANMITTAL  14 дней назад +6

    We are very active on Twitter now-a-days, so lets connect there too ❤

  • @chetan8395
    @chetan8395 11 дней назад

    after so many day !! we missed you . thank you a ton for doing this regularly.

  • @LogicArena01
    @LogicArena01 13 дней назад

    Finally you are back , thanks for the solution and make me understand it very easily ❤

  • @parinav10
    @parinav10 12 дней назад

    Awesome work mate!

  • @RitikTiwary-h1x
    @RitikTiwary-h1x 11 дней назад

    Aryan is Back yeahhh

  • @abhimanyuambastha2595
    @abhimanyuambastha2595 13 дней назад

    Missed your contest solution videos, thanks for coming back!

  • @kbcoder3734
    @kbcoder3734 14 дней назад

    Nice solution, easy to understand

  • @GmcOriginals
    @GmcOriginals 9 дней назад

    yaar awesome explanation, just help me with my doubt pls

  • @top_g755
    @top_g755 10 дней назад +2

    23:47

  • @chaitanyaamajala2582
    @chaitanyaamajala2582 11 дней назад

    It would be great bhaiya if you made a video why u switched job
    How was the new company
    Hiring process
    And all

  • @Its_Shubham_Negi
    @Its_Shubham_Negi 14 дней назад

    thank u bhaia !!

  • @GmcOriginals
    @GmcOriginals 9 дней назад

    bro, dp should store only on dp[tight][stBits], i mean its not making sense to store i with it, i don't see memoised value is used again then, please correct me if i am wrong