<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:

    int to_int(string char_string) {
        int sum = 0;
        for (char i : char_string) {
            sum += static_cast<int>(i);
        }
        return sum;
    }

    string gcdOfStrings(string str1, string str2) {
        std::string smaller = (str1 < str2) ? str1 : str2;
        std::string larger = (str1 > str2) ? str1 : str2;
        
        std::string retString;
        std::string cachedReturn;
        // if str1 + str2 != str2 + str1, return ""
        if (str1 + str2 != str2 + str1) {
            return "";
        }

        // else figure out how to return the largest divisor
        // we know they have to start the same, keep iterating through both until they don't match
        size_t i = 0;
        // get the ascii values for both strings
        int smaller_ascii = to_int(smaller);
        int larger_ascii = to_int(larger);
        while (i < smaller.size()) {
            if (larger[i] == smaller[i]){
                retString = smaller.substr(0,i+1);
                int ret_val = to_int(retString);
                    cout << "ret_string: " << retString << std::endl;
                    cout << "ret_val: " << ret_val << std::endl;
                    cout << "smaller_val: " << smaller_ascii << std::endl;
                    cout << "larger_ascii: " << larger_ascii << std::endl;  
                if ((smaller_ascii % ret_val == 0) && (larger_ascii % ret_val == 0)){
                    cout << "IN IF" << std::endl;
                    cachedReturn = retString;
                }
            }
            i++;
        }
        return cachedReturn;
    }
};
32221