<p>For two strings <code>s</code> and <code>t</code>, we say &quot;<code>t</code> divides <code>s</code>&quot; if and only if <code>s = t + t + t + ... + t + t</code> (i.e., <code>t</code> is concatenated with itself one or more times).</p>

<p>Given two strings <code>str1</code> and <code>str2</code>, return <em>the largest string </em><code>x</code><em> such that </em><code>x</code><em> divides both </em><code>str1</code><em> and </em><code>str2</code>.</p>

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

<pre>
<strong>Input:</strong> str1 = &quot;ABCABC&quot;, str2 = &quot;ABC&quot;
<strong>Output:</strong> &quot;ABC&quot;
</pre>

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

<pre>
<strong>Input:</strong> str1 = &quot;ABABAB&quot;, str2 = &quot;ABAB&quot;
<strong>Output:</strong> &quot;AB&quot;
</pre>

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

<pre>
<strong>Input:</strong> str1 = &quot;LEET&quot;, str2 = &quot;CODE&quot;
<strong>Output:</strong> &quot;&quot;
</pre>

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

<ul>
	<li><code>1 &lt;= str1.length, str2.length &lt;= 1000</code></li>
	<li><code>str1</code> and <code>str2</code> consist of English uppercase letters.</li>
</ul>

class Solution {
public:

    bool check(string s1, string s2){
        int i=0;
        int j=0;

        while(i<s1.size()){
            if(s1[i]!=s2[j]){
                return 0;
            }

            i++;
            j++;
            if(j==s2.size()){
                j=0;
            }
        }

        if(i==s1.size() && j==0){
            return 1;
        }

        return 0;
    }


    string gcdOfStrings(string str1, string str2) {

        string s1;
        string s2;

        if(str1.size()>str2.size()){
            s1 = str1;
            s2 = str2;
        }
        else{
            s1 = str2;
            s2 = str1;
        }

        string og2 = s2;

        while(s2.size()>0){
            cout<<s2<<endl;
            if(check(s1,s2) && check(og2,s2)){
                return s2;
            }

            s2.pop_back();
        }

        return s2;


        
    }
};
32221