Simple java solution
Complexity\n- Time complexity: O(n)\n\n- Space complexity: O(1)\n\n# Code\n\nclass Solution {\n    public boolean isAcronym(List<String> words, String s) {\n   
# Complexity\n- Time complexity: $$O(n)$$\n\n- Space complexity: $$O(1)$$\n\n# Code\n```\nclass Solution {\n    public boolean isAcronym(List<String> words, String s) {\n        StringBuilder nm=new StringBuilder();\n        for(int i=0;i<words.size();i++)\n        {\n            nm.append(words.get(i).charAt(0));\n        }\n        return nm.toString().equals(s);\n    }\n}\n```
['Java']