C#  TWO DIFFERENT O(N) SOLUTION , BEATS 90.12%
Intuition\n Describe your first thoughts on how to solve this problem. \nHello\n\n\n\n# Code // chars\n\npublic class Solution {\n    public bool IsAcronym(ILis
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nHello\n\n\n\n# Code // chars\n```\npublic class Solution {\n    public bool IsAcronym(IList<string> words, string s) {\n        \n        \n\n        char[] x= new char[words.Count];\n\n\n\n        for(int i = 0;i<words.Count;i++){\n            x[i] = char.Parse(words[i].Substring(0,1));\n        }\n        string y = new string(x);\n        if(y.Equals(s)){\n            return true;\n        }\n        return false;\n\n    }\n}\n```\n# Code // StringBuilder\n```\npublic class Solution {\n    public bool IsAcronym(IList<string> words, string s) {\n        if (words.Count == 0) {\n            return false; \n        }\n\n        StringBuilder acronymBuilder = new StringBuilder();\n\n        foreach (string word in words) {\n            acronymBuilder.Append(word[0]);\n        }\n\n        string acronym = acronymBuilder.ToString();\n\n        return acronym.Equals(s);\n    }\n}\n\n```
['C#']