https://leetcode.com/problems/longest-common-prefix/

longest-common-prefix.cpp

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

class Solution {
public:
    string longestCommonPrefix(vector<string> strs)
    {
        if (strs.empty()) return "";
        string prefix = strs[0];

        for (auto& str : strs)
        {
            while (!prefix.empty())
            {
                if (str.find(prefix) != 0)
                {
                    prefix.pop_back();
                }
                else
                {
                    break;
                }
            }
        }

        return prefix;
    }
};

int main()
{
    Solution a;
    auto b = a.longestCommonPrefix({ "a", "acc", "acc" });

    return 0;
}