<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:
    string longestCommonPrefix(vector<string>& vct)
    {
        if (vct.size() == 1) { return vct[0]; }
        
        int size = vct[0].size(); string answer = ""; int count = 0; int index = 0;

        for (int i = 0; i < vct.size(); i++)
        {
            if (vct[i].size() < size) { size = vct[i].size(); }
        }
        
        while (index != size)
        {
            for (int j = 1; j < vct.size(); j++)
            {
                if (vct[0][index] == vct[j][index]) 
                { 
                    count++;
                
                    if (count == vct.size() - 1) 
                    { 
                        answer += vct[0][index]; 
                    } 
                }

                if (j == vct.size() - 1) { index++; }
            }

            if (count != vct.size() - 1) { return answer; } count = 0;
        }

        return answer;
        
    }
};
10800