14. Longest Common Prefix

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        sort(strs.begin(), strs.end());
        
        int n = strs.size();
        int m = min(strs[0].size(), strs[n - 1].size());
        int len = m;
        for (int i = 0; i < m; ++i) {
            if (strs[0][i] == strs[n - 1][i]) continue;
            len = i;
            break;
        }
        return strs[0].substr(0, len);
    }
};