Longest Common Prefix Problem & Solution

#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")

static const int _=[](){std::ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);return 0;}();

class Solution {
public:
  string longestCommonPrefix(vector<string>& strs) {
    if (strs.size() == 1) {
      return strs[0];
    }

    int max = 0;
    while (true) {
      bool ok = true;
      for (int i = 1; i < strs.size(); ++i) {
        if (max >= strs[i].size() ||
            strs[i][max] != strs[0][max]) {
          ok = false;
          break;
        }
      }

      if (ok) {
        ++max;
      } else {
        break;
      }
    }

    return strs[0].substr(0, max);
  }
};