<p>Given two strings <code>a</code> and <code>b</code>, return <em>the minimum number of times you should repeat string </em><code>a</code><em> so that string</em> <code>b</code> <em>is a substring of it</em>. If it is impossible for <code>b</code>​​​​​​ to be a substring of <code>a</code> after repeating it, return <code>-1</code>.</p>

<p><strong>Notice:</strong> string <code>&quot;abc&quot;</code> repeated 0 times is <code>&quot;&quot;</code>, repeated 1 time is <code>&quot;abc&quot;</code> and repeated 2 times is <code>&quot;abcabc&quot;</code>.</p>

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

<pre>
<strong>Input:</strong> a = &quot;abcd&quot;, b = &quot;cdabcdab&quot;
<strong>Output:</strong> 3
<strong>Explanation:</strong> We return 3 because by repeating a three times &quot;ab<strong>cdabcdab</strong>cd&quot;, b is a substring of it.
</pre>

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

<pre>
<strong>Input:</strong> a = &quot;a&quot;, b = &quot;aa&quot;
<strong>Output:</strong> 2
</pre>

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

<ul>
	<li><code>1 &lt;= a.length, b.length &lt;= 10<sup>4</sup></code></li>
	<li><code>a</code> and <code>b</code> consist of lowercase English letters.</li>
</ul>

class Solution {
public:

    bool isPossible(string &s, string &b){
        for(int i=0;i<=s.size()-b.size();i++){
            if(s.substr(i, b.size()) == b){
                return true;
            }
        }
        return false;
    }


    int repeatedStringMatch(string a, string b) {
        unordered_map<char, int> bUmp;
        unordered_map<char ,int> aUmp;

        for(int i=0;i<a.size();i++){
            aUmp[a[i]]++;
        }

        for(int i=0;i<b.size();i++){
            bUmp[b[i]]++;
        }

        double factor = 0;
        for(auto itr = b.begin();itr!=b.end();itr++){
            if(aUmp[*itr] == 0){
                return -1;
            }
            factor = max(factor, 1.0*bUmp[*itr]/aUmp[*itr]);
        }

        int multiply = ceil(factor);
        string temp = "";
        for(int i=0;i<multiply;i++){
            temp+=a;
        }

        if(isPossible(temp, b)){
            return multiply;
        }
        
        temp+=a;
        if(isPossible(temp, b)) return multiply+1;

        return -1;
    }
};
92738