class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        if (strs.empty()) return "";

        string comm = "";
        int n = strs.size();

        for (int left = 0; left < strs[0].size(); left++) {
            char ch = strs[0][left];

            for (int i = 1; i < n; i++) {
                
                if (left >= strs[i].size() || strs[i][left] != ch) {
                    return comm;
                }
            }

            
            comm += ch;
        }

        return comm;
    }
};