word pattern Easy soln using set N hash_map
 vector<string>v;
        string temp =  "";
        
        for(int i=0;i<s.size();i++){
            if(s[i]==' '){
                v.push_back(temp);
                temp ="";
            }
            
            else{
                temp = temp +s[i];
            }
        }
        v.push_back(temp);
        
        if(v.size()!=pattern.size())
            return false;
        unordered_map<char,string>mp;
        set<string>st;
        for(int i=0;i<pattern.size();i++){
            if(mp.find(pattern[i])!=mp.end()){
                if(mp[pattern[i]]!=v[i])
                    return false;
            }
            
            else{
                if(st.count(v[i])>0)
                    return false;
            
            mp[pattern[i]] = v[i];
            st.insert(v[i]);
            }
        }
        
        
        return true;
Comments (0)