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

  Рет қаралды 2,851

Techdose

Techdose

Күн бұрын

Пікірлер: 21
@baka_man2512
@baka_man2512 2 күн бұрын
Thanks for the detailed explanation sir and also for the consistency
@techdose4u
@techdose4u 2 күн бұрын
welcome :)
@freecourseplatformenglish2829
@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
@techdose4u Күн бұрын
nice
@ahmedtremo
@ahmedtremo 2 күн бұрын
Thanks for the detailed explanation, well done
@techdose4u
@techdose4u 2 күн бұрын
welcome :)
@rakshitshandilya9934
@rakshitshandilya9934 2 күн бұрын
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
@techdose4u
@techdose4u 2 күн бұрын
👐🏼
@sailendrachettri8521
@sailendrachettri8521 2 күн бұрын
Thank you sir :)
@techdose4u
@techdose4u 2 күн бұрын
welcome :)
@GMGLPL
@GMGLPL 2 күн бұрын
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 2 күн бұрын
coz of more nodes to process and N ary tree has base of power higher (N) than binary (2)
@baka_man2512
@baka_man2512 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 )
@pijushbarai4659
@pijushbarai4659 2 күн бұрын
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-A
@SAjithkumar-A 2 күн бұрын
Sir, today i attend your live, kindly make community post in future live
@techdose4u
@techdose4u Күн бұрын
for planned sessions we will
@godFather-123-b8g
@godFather-123-b8g 2 күн бұрын
how to build intution to solve these kind of problems??
@techdose4u
@techdose4u 2 күн бұрын
practice………maybe :)
@manu-singh
@manu-singh 3 күн бұрын
sir apki consistency ko naman🙏 But ek baat ha ki subah subah hi solution paros dete ho, bigaad rhe ho thoda 😅
@techdose4u
@techdose4u 3 күн бұрын
dhanyawaad :) Solution try krne ke baad hi dekho :)
@manu-singh
@manu-singh 3 күн бұрын
@techdose4u ji sir try to yhi karte ha😅
Maximum Score After Splitting a String | Leetcode 1422
8:22
Chain Game Strong ⛓️
00:21
Anwar Jibawi
Рет қаралды 41 МЛН
Cheerleader Transformation That Left Everyone Speechless! #shorts
00:27
Fabiosa Best Lifehacks
Рет қаралды 16 МЛН
99.9% IMPOSSIBLE
00:24
STORROR
Рет қаралды 31 МЛН
Count Ways To Build Good Strings | Leetcode 2466
18:35
Techdose
Рет қаралды 1,2 М.
Maximum Sum of 3 Non Overlapping Subarrays | Leetcode 689
24:00
Minimum Cost For Tickets | Leetcode 983
20:31
Techdose
Рет қаралды 2 М.
Vim Tips I Wish I Knew Earlier
23:00
Sebastian Daschner
Рет қаралды 84 М.
31 nooby C++ habits you need to ditch
16:18
mCoding
Рет қаралды 844 М.
Chain Game Strong ⛓️
00:21
Anwar Jibawi
Рет қаралды 41 МЛН