class Solution {
public:
int countConsistentStrings(string allowed, vector& words) {

    map<int,int>mp;
          for(int k=0;k<allowed.length();k++){
              mp[allowed[k]]++;
          }
    int g=0;
    int c=0;
    for(int i=0;i<words.size();i++){
       c=0;
      for(int j=0;j<words[i].length();j++){
           if(mp.find(words[i][j])==mp.end())
           {  c=1;
            break;}
      }
        

        if(c!=1)
            g++;
        
        
 }

return g; }
};

Comments (1)