GFG ANAGRAM SUBSTRING SEARCH

#include<iostream>
#include<cstring>

#define MAX 256
using namespace std;
 
bool compare(char arr1[], char arr2[]) {
    for (int i=0; i<MAX; i++)
        if (arr1[i] != arr2[i])
            return false;
    return true;
}
 
void search(char *pat, char *txt) {
    int M = strlen(pat)
    int N = strlen(txt);
    char countP[MAX] = {0}, countTW[MAX] = {0};
    
    for (int i = 0; i < M; i++) {
        (countP[pat[i]])++;
        (countTW[txt[i]])++;
    }
    for (int i = M; i < N; i++) {
        if (compare(countP, countTW))
            cout << "Found at Index " << (i - M) << endl;
        (countTW[txt[i]])++;
        countTW[txt[i-M]]--;
    }
 
    if (compare(countP, countTW))
        cout << "Found at Index " << (N - M) << endl;
}
 
int main() {
    char txt[] = "BACDGABCDA";
    char pat[] = "ABCD";
    search(pat, txt);
    return 0;
}