Given array as:
[
"abcdefgh",
"aefghijk",
"abcefgh"
]
Solution
string getPrefix(string a, string b){
int l = min(a.size(), b.size());
string r="";
for (int i; i < l; i++){
if (a[i] == b[i]){
string t{a[i]};
r = r + t;
}
}
return r;
}
string longestCommonPrefix(vector<string> &A) {
string r = A[0];
for (int i = 1; i < A.size(); i++){
r = getPrefix(r, A[i]);
}
return r;
}