<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:
    [[nodiscard]]
    auto repeatedSubstringPattern(const std::string_view s) const
    -> bool
    {
        const int sLen = s.length();
        const int halfsLen = sLen / 2;
        std::string sub;

        for (int i { 0 }; i < halfsLen; ++i)
        {
            sub += s[i];

            if (sLen % (i + 1))
            {
                continue;
            }

            std::string candidate;

            while (candidate.length() < sLen)
            {
                candidate.append(sub);
            }

            if (candidate == s)
            {
                return true;
            }
        }

        return false;    
    }
};
90806