Number of Ways to Form a Target String Given a Dictionary | Leetcode 1639

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

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

  • @baka_man2512
    @baka_man2512 3 дня назад

    Thanks for the detailed explanation sir and also for the consistency

  • @VISHALMISHRA-ff2ih
    @VISHALMISHRA-ff2ih 4 часа назад

    I don't know why this channel is not getting that much popularity which it deserve. But one day it will definitely.
    I recommend everyone for it.
    Very nice explanation.

  • @freecourseplatformenglish2829
    @freecourseplatformenglish2829 2 дня назад

    Thanks man. This question is quiet similar to yesterdays one based on 0/1 knapsack pattern. That actually helped me solved this one on my own with little help from your explanation.

  • @rakshitshandilya9934
    @rakshitshandilya9934 3 дня назад

    That is really good explanation..I think it is a very good approach for recursion/dp problems ...most of difficult things are sorted once we draw the rec tree

  • @ahmedtremo
    @ahmedtremo 3 дня назад +1

    Thanks for the detailed explanation, well done

  • @sailendrachettri8521
    @sailendrachettri8521 3 дня назад +1

    Thank you sir :)

  • @GMGLPL
    @GMGLPL 3 дня назад

    I tried the n-ary recursion tree + memoization along with freq compression but that also TLE'd at 85/90 test cases. Any idea why is that different than the binary recursion based solution?

    • @techdose4u
      @techdose4u  3 дня назад +1

      coz of more nodes to process and N ary tree has base of power higher (N) than binary (2)

    • @baka_man2512
      @baka_man2512 3 дня назад +1

      maybe because this might have increased the recursive tree diameter relative to it's depth which is not favourable and optimal for dp or mem as this might lead to extra not required computations(it's just a guess i hope this may be of your help )

  • @SAjithkumar-A
    @SAjithkumar-A 2 дня назад

    Sir, today i attend your live, kindly make community post in future live

    • @techdose4u
      @techdose4u  2 дня назад

      for planned sessions we will

  • @pijushbarai4659
    @pijushbarai4659 3 дня назад

    can anyone explain me in code where we check that the target[tpos] and the words[0 to wordsize-1] is equal or not.
    for myself it is check all and include all and exclude all . if you have beter understanding . explain to me .

  • @godFather-123-b8g
    @godFather-123-b8g 3 дня назад

    how to build intution to solve these kind of problems??

  • @manu-singh
    @manu-singh 3 дня назад +1

    sir apki consistency ko naman🙏
    But ek baat ha ki subah subah hi solution paros dete ho, bigaad rhe ho thoda 😅

    • @techdose4u
      @techdose4u  3 дня назад +2

      dhanyawaad :)
      Solution try krne ke baad hi dekho :)

    • @manu-singh
      @manu-singh 3 дня назад +1

      @techdose4u ji sir try to yhi karte ha😅