Algorithm

Let’s take the first example, string P is “abc”, Anagrams of string P in S are “abc”, ”cab”, “bac”. Let's sort the string P and its Anagrams. String P becomes “abc” and Anagrams becomes “abc”, “abc”,”abc”. We can observe that Upon sorting String P becomes equal to Anagrams.
So if the sorted version of any substring in S is equal to Sorted String P . Then that particular substring is an Anagram of P. As there are the same characters in Anagrams and String P, sorting them yields the same result

Code

#include <bits/stdc++.h>
using namespace std;
class Solution{
vector<int> FindAnagrams(string &s, string &p)
{
    vector<int> ans;
    int n = s.length(), m = p.length();
    // sortedP stores the sorted version of string P
    string sortedp = p;
    sort(sortedp.begin(), sortedp.end());
    string temp;
    for (int i = 0; i <= (n - m); i++)
    {
        temp = "";
        // temp stores the every substring of length m
        for (int k = i; k < m + i; k++)
            temp.push_back(s[k]);
        sort(temp.begin(), temp.end());
        // checking sorted version of substring equal to sorted P are not
        if (temp == sortedp)
            ans.push_back(i);
    }
    return ans;
}
int main()

{
    string s = "tufuftfut", p = "tuf";
    vector<int> arr = FindAnagrams(s, p);
    if (arr.empty())
        cout << "There are No Anagrams of