<p>Given a string <code>s</code>, check if it can be constructed by taking a substring of it and appending multiple copies of the substring together.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abab&quot;
<strong>Output:</strong> true
<strong>Explanation:</strong> It is the substring &quot;ab&quot; twice.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aba&quot;
<strong>Output:</strong> false
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abcabcabcabc&quot;
<strong>Output:</strong> true
<strong>Explanation:</strong> It is the substring &quot;abc&quot; four times or the substring &quot;abcabc&quot; twice.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 10<sup>4</sup></code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

class Solution {
public:
    bool repeatedSubstringPattern(string s) {

        int n = s.size();
        string temp;
        temp += s[0];
        char comp = s[0];

        for(int i = 1; i < n; i++) {
            if(s[i] != comp) temp += s[i];
            else {
                int n1 = temp.size();
                int j = i;
                while(j < n) {
                    if(n - j >= n1) {
                        if(temp == s.substr(j, n1)) {
                            j = j + n1;
                            if(j == n) return true;
                        }
                        else {
                            temp = temp + s[i];
                            break;
                        }
                    }
                    else return false;
                }
            }
        }

        return false;
        
    }
};
84333