Count_Number_of_consistent_string.cpp

/* https://leetcode.com/problems/count-the-number-of-consistent-strings/description/ */

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

       int count=0; 
        for(int i=0;i<words.size();i++)
        {
            for(int j=0;j<words[i].size();j++)
            {
                if(allowed.find(words[i][j])!=string::npos)
                {

                }
                else
                {
                    count++;
                    break;
                }
            }
        }
        return words.size()-count;
    }
};