Word Pattern Matching using Backtracking | Leetcode Solutions in JAVA

[@ghanibhai1630]

did it on my own Thanks to god and Summet Sir

[@mehulshrimali1951]

Great Explanation bro!!!........

[@hariomsingh1736]

you are awesome sir

[@himanshuchhikara4918]

sir bahut mast but I have one suggestion for you please write time-complexity and space complexity in editorials on pepcoding portal for this questions specially backtracking vaale

[@Pepcoding]

Noted

[@ankitamehra5045]

arrey sir, yeh tshirt badiya hai ekdum!

[@Pepcoding]

haha. thank you. webinar karao, aapko bhi bhej denge. Also a very cool laptop bag.

[@code7434]

alag level :)

[@Pepcoding]

thank you. If you like the content, please share and subscribe. If you can help me get a webinar, we can send you some cool pepcoding goodies

[@mehulbisht9708]

sir i had 2 major doubts , 1) 14:41 sir , are these answers also valid as per the given problem ? {p=g, e=oodbad} {p=go, e=odbad} {p=goo, e=dbad} {p=good, e=bad} {p=goodb, e=ad} {p=goodba, e=d} 2) also, sir if we are given first string as "ppe" or "epp", but not "pep" but the other string is the same, i.e. "graphtreesgraph", will this approach still work ?

[@Pepcoding]

for 2. yes, ppe aur epp ke case mei answer he nahi aaega. same order jaroori hai. for 1. yes

[@mehulbisht9708]

@@Pepcoding nice to hear this ! otherwise i would be thinking that the code that i made without watching solution was incorrect !

[@tonystarc9567]

Sir what about pattern "abba" and string "dog dog dog dog" here this is taking dog as 'a' and dog as 'b' and we want 'dog' to be only taken by exactly 1 character of pattern. Hence it is given false for this case and my output is coming true.

[@Pepcoding]

Beta mera solution is case mei false he dega

[@shauncrasta619]

@@Pepcoding No sir its giving true

[@abhishekjha8220]

Tm space hta do to a=dogd , aur b=og ,se ye ho jayga

[@mrmagician5609]

Was able to do without watching the video. Thanks!

[@Pepcoding]

Glad I could help!

[@harishgaddapara1511]

Great Explanation sir! we are putting only unique chracters in the map so why we need to use hashset again

[@boredpotato6366]

Because the answer has to be printed in same order as the original pattern. If we loop on map.keySet() then it will give answer in random order.

[@mohitmittal10]

lot of likes :)

[@CodeCraftWithVinayak]

please discuss time and space complexity, mene try kiya derive karne but difficult laga.

[@Pepcoding]

hanji. bhool ja rha hai. shuru karunga

[@harshtekriwal131]

Sir isme ek issue aaskta hai , lets say string is dogdog and pattern is ab, then there will be a case where it will map 'a' with "dog" and 'b' will also be " dog" , basic according to this , two different characters can have the same mapping.

[@LegitGamer2345]

make a map of count of values , if count of any value is >1 then dont print here dog->2 so dont print just return

[@yuvraj2038]

Time complexity?

[@tusharjha2150]

Aaj 5 savaal minimum 🙈

[@Pepcoding]

poori koshish rahegi. 2sra bna dia already. aa rha hai

[@SCRIPTSAG]

Sir deeply tree answer tak ka bnana pda tab jaker clear huwa actually ho kya rha hai question ka logic pakdne me thoda thoda miss ker ja rha hu i think sir practice kerte rahunga ek din jaruar ho jayega

[@Pepcoding]

Hanji beta, aise he lge rho aur sbka euler tree bnane ki koshish kiya kro.

[@dtu-tech]

Sir telegram channel link no exist

[@Pepcoding]

t.me/pepcoding

[@yeshisrivastava2408]

but this doesnt work! I tried it with same code .. did anyone tried it??

[@yeshisrivastava2408]

@@Kashish_Batra can you share the leetcode link of your solution?

[@frankfill2050]

I think this solution would fail with this test case => pattern: "ab" and string: "aa"

[@anjneykumarsingh4461]

Sir goodies asey hi mt dijiye koi contest k through milta toh mza ata

[@Pepcoding]

apne paas 3000 bag rakha hai. aise bhi kar lenge aur waise bhi