class Solution {
public:
    vector<int> findAnagrams(string s, string p) {
        vector<int> setofindex;
        vector<int>ms(26);
        vector<int>mp(26);
        if(p.size()>s.size()) return setofindex;
        for(int i=0; i<p.size(); i++){
            mp[p[i] - 'a']++;
            ms[s[i] - 'a']++;
        }
        if(ms==mp) setofindex.push_back(0);
        for(int i=p.size(); i<s.size(); i++){
            ms[s[i]-'a']++;
            ms[s[i-p.size()]-'a']--;
            if(ms==mp) setofindex.push_back(i-p.size()+1);
        }
        return setofindex;
    }
};

// this is shit is complex!