<p>Write a function to find the longest common prefix string amongst an array of strings.</p>

<p>If there is no common prefix, return an empty string <code>&quot;&quot;</code>.</p>

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

<pre>
<strong>Input:</strong> strs = [&quot;flower&quot;,&quot;flow&quot;,&quot;flight&quot;]
<strong>Output:</strong> &quot;fl&quot;
</pre>

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

<pre>
<strong>Input:</strong> strs = [&quot;dog&quot;,&quot;racecar&quot;,&quot;car&quot;]
<strong>Output:</strong> &quot;&quot;
<strong>Explanation:</strong> There is no common prefix among the input strings.
</pre>

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

<ul>
	<li><code>1 &lt;= strs.length &lt;= 200</code></li>
	<li><code>0 &lt;= strs[i].length &lt;= 200</code></li>
	<li><code>strs[i]</code> consists of only lowercase English letters.</li>
</ul>

class Solution {
public:
    bool areEqual(string str1, string str2){
        if(str1.size() != str2.size()) return 0;
        for(int i=0; i<str1.size(); i++){
            if(str1[i] != str2[i]) return 0;
        }
        return 1;
    }
    string longestCommonPrefix(vector<string>& strs) {
        string prefix = strs[0];

        for(int i = 1; i<strs.size(); i++){
            string x = strs[i];
            while(1){
                cout<<prefix<<endl;
                if(areEqual(prefix,x)) break;
               
                int s = prefix.size();
                if(prefix.size() == 0) return "";

                if(prefix.size() > x.size()) prefix = prefix.substr(0,s-1);
                else if(prefix.size() == x.size()){
                    prefix = prefix.substr(0,s-1);
                    x = x.substr(0,x.size()-1);
                }
                else x = x.substr(0,x.size()-1);
            }
            
        }
    return prefix;
    }
};
14000