<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) {

        //         queue<int> q;

        //         for(int i=0;i<s.size();i++){
        //             if(s[i]!=q.front()){
        //                 q.push(s[i]);
        //             }
        //             else{
        //                 q.pop();
        //             }
        //         }

        // if(q.empty()|| q.size()%2==0){
        //     return true;
        // }

        //     return false;
        int n = s.size();

        for (int i = 1; i <= n / 2; i++) {

            string temp = s.substr(0, i);
            string result = "";

            while (result.size() < s.size()) {
                result += temp;
            }
            if (result == s) {
                return true;
            }
        }

        return false;
    }
};
440321