Thanks for the detailed explanation sir and also for the consistency
@techdose4u2 күн бұрын
welcome :)
@freecourseplatformenglish2829Күн бұрын
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.
@techdose4uКүн бұрын
nice
@ahmedtremo2 күн бұрын
Thanks for the detailed explanation, well done
@techdose4u2 күн бұрын
welcome :)
@rakshitshandilya99342 күн бұрын
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
@techdose4u2 күн бұрын
👐🏼
@sailendrachettri85212 күн бұрын
Thank you sir :)
@techdose4u2 күн бұрын
welcome :)
@GMGLPL2 күн бұрын
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?
@techdose4u2 күн бұрын
coz of more nodes to process and N ary tree has base of power higher (N) than binary (2)
@baka_man25122 күн бұрын
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 )
@pijushbarai46592 күн бұрын
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 .
@SAjithkumar-A2 күн бұрын
Sir, today i attend your live, kindly make community post in future live
@techdose4uКүн бұрын
for planned sessions we will
@godFather-123-b8g2 күн бұрын
how to build intution to solve these kind of problems??
@techdose4u2 күн бұрын
practice………maybe :)
@manu-singh3 күн бұрын
sir apki consistency ko naman🙏 But ek baat ha ki subah subah hi solution paros dete ho, bigaad rhe ho thoda 😅
@techdose4u3 күн бұрын
dhanyawaad :) Solution try krne ke baad hi dekho :)