L:eetcode_easy_14_longestcommonprefix.cpp

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
    string ans;
    int i=0;
    while(true)
    {
        char curr_ch =0;
        for(auto str : strs)
        {
            //out of bound
            if(i>=str.size())
            {
                curr_ch = 0;
                break;
            }
            // just starting
            if(curr_ch ==0)
            curr_ch = str[i];
            else if(str[i] != curr_ch)
            {
                curr_ch =0;
                break;
            }
        }
        if(curr_ch ==0)
        break;
        ans.push_back(curr_ch);
        i++;
    }      
    return ans;
    }
};