[C++] 100% Faster Solution | Simplest | Easiest | Optimal Solution.
Complexity\n- Time complexity:\nO(n)\n\n- Space complexity:\nO(1)\n\n# Code\n\nclass Solution {\npublic:\n    bool isAcronym(vector<string>& words, string s) {\
# Complexity\n- Time complexity:\nO(n)\n\n- Space complexity:\nO(1)\n\n# Code\n```\nclass Solution {\npublic:\n    bool isAcronym(vector<string>& words, string s) {\n\n        string t = "";\n\n        for(auto it : words) \n            t += it[0];\n\n        return t == s;\n        \n    }\n};\n```
['String', 'String Matching', 'C++']