C++ || beats 100% || Killer solution by sd
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    bool isAcronym(vector<string>& words, string s) \n    {\n        string str="";\n        int n=words.size();\n        for(int i=0;i<n;i++)\n        {\n            string str1=words[i];\n            str.push_back(str1[0]);\n        }\n        if(s==str)\n            return true;\n        else\n            return false;\n        \n    }\n};\n```
['C++']