lab 4 z2 ERROR FUNCT

#include <iostream>
#include <string>
using namespace std;
int searching_of_repeats(string);
void entering(int, string);
int main()
{
    cout << "Enter text: " << endl;
    string text, rez;
    getline(cin, text);
    int maxs= searching_of_repeats(text);
    entering(maxs, text);
    return 0;
}

int searching_of_repeats(string str)
{
    int j = 0;
    int len = 0;
    int p;
    int nast = 0;
    int maxs1;
    int maxrep = 0;
    for (int i = 1; i < str.size(); i++)
    {
        maxs1 = 0;
        p = str.find_first_of(" ", j);
        if (p == -1)
        {
            break;
        }
        len = p - nast;//длина слова с учетом пробела
        nast = p;
        int nach = p - len; //начало нового слова
        int* mas = new int[len-1];
        for (int l = 0; l < len-1; l++)
        {
            mas[l] = 0;
        }
      //  mas[0]++;
        for (int t = 0; t < len; t++)
        {
            if (str.find(str[t]) <= t)
            {
                mas[str.find_first_of(str[t])]++;
            }
        }
        for (int l = 0; l < len - 1; l++)
        {
            if (mas[l] > maxs1)
            {
                maxs1 = mas[l];
            }
        }
        if (maxs1 > maxrep)
        {
            maxrep = maxs1;
        }
        delete[] mas;
        j = p + 1;
    }
    cout << maxrep << endl;
return maxrep;
}

    void entering(int maxrep, string text1)
    {
        string rez;
        int j = 0;
        int len = 0;
        int p;
        int nast = 0;
        for (int i = 1; i < text1.size(); i++)
        {
            int maxs1 = 0;
            p = text1.find_first_of(" ", j);
            if (p == -1)
            {
                break;
            }
            len = p - nast;//длина слова с учетом пробела
            nast = p;
            int nach = p - len; //начало нового слова
            int* mas = new int[len-1];
            for (int l = 0; l < len-1; l++)
            {
                mas[l] = 0;
            }
           // mas[0]++;
            for (int t = 0; t < len; t++)
            {
                if (text1.find(text1[t]) <= t)
                {
                    mas[text1.find_first_of(text1[t])]++;
                }
            }
            for (int l = 0; l < len-1; l++)
            {
                if (mas[l] > maxs1)
                {
                    maxs1 = mas[l];
                }

            }
           if (maxs1 == maxrep)
            {
                rez.append(text1, nach, len);
            }
            delete[] mas;
            j = p + 1;
        }
       cout << rez;
    }