<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();
        
        // Check possible lengths for the repeated substring pattern
        for (int len = 1; len <= n / 2; ++len) {
            if (n % len == 0) {  // Check if `len` divides `n`
                string sub = s.substr(0, len);
                string repeated = "";
                
                // Repeat the substring len times to reconstruct the original string
                for (int i = 0; i < n / len; ++i) {
                    repeated += sub;
                }
                
                // If the constructed string matches the original, return true
                if (repeated == s) {
                    return true;
                }
            }
        }
        
        // If no valid repeating pattern found, return false
        return false;
    }
};

97278