Word Pattern -(Amazon, MakeMyTrip, Microsoft) : Explanation ➕ Live Coding

This is the 3rd Video of our Hash Map/Set Playlist.
In this video we will try to solve a very good problem "Word Pattern".
Problem Name : Word Pattern
Company Tags : Amazon, MakeMyTrip, Microsoft
My solutions on Github : github.com/MAZ...
Leetcode Link : leetcode.com/p...
My GitHub Repo for interview preparation : github.com/MAZ...
Subscribe to my channel : / @codestorywithmik
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish

[@sarathkumardunga5240]

Happy new year Bhaiya❤.. I am sure ki i am gonna learn a lot in this year too. One of the best thing that happened in Last year is that I randomly found this amazing channel in Demeber. U have a unique way of explaining things.Plss keep continuing the good work. Hope this content reaches many more this year.Looking forward for other videos

[@codestorywithMIK]

Thank you so so so much Sarath. Your comment made my day. Good way to start my year. Thanks a lot. And yeah, let’s rock this year and bring out the coder within us 💪💪💪💪

[@dayashankarlakhotia4943]

Class solution { Public boolean word pattern *string pattern, string s){ string arr[]=s.split(" "); if(pattern. length!=array. length)return false; Mapmap=Hash map(); for(int i=0;i< pattern. length; i++){ char ch=pattern. charAt(i); boolean contains key= map. contains key(ch); if(map .contains value(arr[i])&&!contains key)return false if(contains key&& !map.get(ch).equal (arr[i])) return false else map .put(ch,arr[i]); } return true } };

[@souravjoshi2293]

Thanks a lot man. I have taken a resolution to solve at least one Qn every day this year. Thanks to you for the motivation

[@codestorywithMIK]

That’s the spirit 💪❤️

[@riteshhhhh_01]

It is more similar to L205 and in this question why leetcode us "Bijection" it means the combination of injection and subjection 😢

[@arunsharma4792]

Sir i am not able to remember solution of previously solved question . After 3 days i forget everything what i did in that question what to do ??

[@sarathkumardunga5240]

Try to go about a problem from the scratch in a logical and sequential manner. Dont try to replicate the solution that u had learnt. Try to implement in your own way from the experience u have gained. keep practicing.. u can see the progress.

[@codestorywithMIK]

Hi Arun, The problem you mentioned is faced by everyone. Me also The only thing we do to atleast fight this problem is to never stop solving In worst case, solve atleast one problem a day And try solving random Qn. It helps your brain to recollect more that from which Algo/DS it can be solved. Trust me, people code for years and still they have this issue. Because that's how it is. The important thing is BE CONSISTENT It will give you a sense of confidence that you are doing everyday and it will play a very important role for your future.

[@sounishnath513]

I was stuck because i only focus using string spit by space and Map but few cases not passed😢

[@codestorywithMIK]

No worries Sounish. It’s totally fine to get stuck. If it taught you something, then we didn’t loose anything right 💪😊 I usually never underestimate Easy Tagged Qns. Because 1) They help me to increase speed 2) For Practice , it’s good 3) Try multiple approaches 4) Some Easy are very very good and worth a try.

[@piyushacharya7696]

Loved it bro.😎😎 I wrote this shitty code and came here to learn a better and optimised approach. Always love your approach bhai. Now it's time to grow your channel🔥 If possible update the channel banner and the logo.😁😁 class Solution { public: vector splitWords(string sentence) { string temp; vector arr; stringstream ss(sentence); // convert sentence to words // taking each word and putting it into a vector. while (ss >> temp) { arr.push_back(temp); } return arr; } // tc : O(3n) // not the very optimal code. // since it is of "easy" category so not bothering much. bool wordPattern(string pattern, string s) { int patlen = pattern.size(); vector words = splitWords(s); // since each char must associate with each word so diff len then return false. if (words.size() != patlen) return false; unordered_map map; unordered_map map2; // char -> word. for (int i = 0; i < words.size(); i++) { char key = pattern[i]; string word = words[i]; auto it = map.find(key); // if it does not exists. if (it == map.end()) { map[key] = word; } else { // if the key already exists. if (it->second != word) return false; } } // word -> char for (int i = 0; i < words.size(); i++) { string key = words[i]; char val = pattern[i]; auto it = map2.find(key); // if it does not exists. if (it == map2.end()) { map2[key] = val; } else { // if the key already exists. if (it->second != val) return false; } } // if there are all words the same then also using the two map concept helps. /* example: a b b a dog dog dog dog In map 1: a -> dog b -> dog In map 2: dog -> a/b which is handled. but simply using the one map does not work in this case. */ if (map.size() != map2.size()) return false; return true; } };

[@codestorywithMIK]

Thanks a lot Piyush. And Yes, i will changing the logo and name of my channel may be today or tomorrow EOD Thanks always for your valuable suggestions ❤️❤️❤️❤️

[@piyushacharya7696]

@@codestorywithMIK Yeah and if possible do not add underscore to the channel name as it does not look any good.😅😅

[@codestorywithMIK]

I totally agree. I will remove underscore. Thanks a lot ❤️❤️❤️

[@alokgautam02]

Hoping to get same quality videos from you this year also !

[@codestorywithMIK]

Sure thing Alok ❤️❤️❤️

[@prajwalshaw9217]

Can anyone tell me why this code is not working...it is passing 30 cases out of 42 cases on lc. The similar code is working for the problem isomorphic strings on lc. class Solution { public: bool wordPattern(string pattern, string s) { unordered_mapmp; unordered_mapused; vectortemp; int cnt=0; for(int i=0;i

[@Anurag-fk3op]

At 8:06 what I did was else { // If the word doesn't exist in map char c = pattern[i]; // Current character in pattern // Check if the character is already mapped to any other word for (auto it : mp) { if (it.second == c) return false; } Time complexity kya hoga ??

[@prajwalshaw9217]

What is the time complexity of approach 1?

[@chitranshjain9714]

class Solution { public: bool wordPattern(string pattern, string s) { stringstream ss(s); string token; vector tokens; while (getline(ss, token, ' ')) { tokens.push_back(token); } if (pattern.length() != tokens.size()) { return false; } unordered_map mpp; unordered_set st; for (int i = 0; i < pattern.length(); i++) { char ch = pattern[i]; if (mpp.find(tokens[i]) == mpp.end() && st.find(ch) != st.end()) { return false; } else if (mpp.find(tokens[i]) != mpp.end()) { if (mpp[tokens[i]] != ch) { return false; } } mpp[tokens[i]] = ch; st.insert(ch); } return 1; } };

[@DevOpskagyaan]

Legend

[@danishsaifi1038]

Nice name for the channel.

[@codestorywithMIK]

Thanks a lot ❤️❤️❤️

[@gautamarora6556]

@@codestorywithMIK What was the old name of your channel ?

[@codestorywithMIK]

interview_DS_Algo

[@udaytewary3809]

Really thankyou bhaiya your awesome and I am really lucky that I found your channel. Solved the question but only able to pass 31/37 test cases so came here to watch your solution and you always rock and teaches us new thing and for me l learnt about stringstream And also one thing bhaiya in your third approach in the if condition outside the loop I think there is no need to write i!=n because i!= n says that countToken is also not equal to n and I also have checked that it is working fine and passed all the test cases

[@codestorywithMIK]

Thanks a lot Uday. And yes you are right for i!=n part Thank you so much Uday for pointing this out

[@cj-nr5ni]

Great teaching skills … hopin for lld /hld …may be too much to ask .. 😅 nice playlist

[@codestorywithMIK]

Thanks a lot. Soon will plan HLD and LLD

[@pritishpattnaik4674]

So nice approach , I learnt another approach My approach : vector strToVec(string s){ s += ' '; vector ans; string temp = ""; for (auto x : s){ if (x == ' '){ ans.push_back(temp); temp.clear(); } else temp.push_back(x); } return ans; } bool wordPattern(string pattern, string s) { vector str = strToVec(s); map mp1; for (int i=0 ; i

[@codestorywithMIK]

Awesome. Thanks a lot ❤️❤️❤️

[@nagmakhan3165]

Thanks a lot So much to learn from this

[@HolidayHaven-qf3ym]

Happy new year! Hope aapki help se meri DSA ki journey acchi ho!

[@codestorywithMIK]

💪💪❤️❤️

[@wearevacationuncoverers]

Great teaching skills

[@manishv.8167]

Hi , Today again you miss to upload the concept video , I was waiting for it ...

[@codestorywithMIK]

Hi Manish, Will upload tomorrow as today had some tight schedule of other works.

[@manishv.8167]

@@codestorywithMIK ok no issues...🥰

[@codestorywithMIK]

Thanks for understanding. I will try to put more than 1 videos.

[@abhinavkumar1356]

thanks brother

[@codestorywithMIK]

Thanks a lot for watching Abhinav ❤️❤️❤️

[@sarathkumardunga5240]

For someone who want to solve the question with above logic without using stringstream function class Solution { public: bool wordPattern(string pattern, string s) { int wordCount = 0; int l = s.length(); for(int i = 0; i= 'a' && it

[@codestorywithMIK]

Thanks a lot