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.
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.
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
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?
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 )
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 .
Thanks for the detailed explanation sir and also for the consistency
welcome :)
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.
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.
nice
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
👐🏼
Thanks for the detailed explanation, well done
welcome :)
Thank you sir :)
welcome :)
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?
coz of more nodes to process and N ary tree has base of power higher (N) than binary (2)
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 )
Sir, today i attend your live, kindly make community post in future live
for planned sessions we will
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 .
how to build intution to solve these kind of problems??
practice………maybe :)
sir apki consistency ko naman🙏
But ek baat ha ki subah subah hi solution paros dete ho, bigaad rhe ho thoda 😅
dhanyawaad :)
Solution try krne ke baad hi dekho :)
@techdose4u ji sir try to yhi karte ha😅