<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 prefixx(string s1, string s2){
        string ans = "";
        int i = 0 ;
        int n1 = s1.size();
        int n2 = s2.size();

        //if(n1 == 0 || n2 == 0 ) return ans;

        while(i< min(n1,n2)){
            if(s1[i] == s2[i]){
                ans = ans+s1[i];
            }
            else return ans ;
            i++;
        }
        return ans ;
    }
    string longestCommonPrefix(vector<string>& strs) {

        string prefix = strs[0];

        for(int i = 1 ; i<strs.size(); i++){
            prefix = prefixx(prefix,strs[i]);
        }
        return prefix;
    }
};
17600