Easy Approach || Beginner Friendly|| Java ||Weekly Contest
PEASE UPVOTE\n\n# Complexity\n- Time complexity:O(n)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity:O(n)\n Add your space complexity here, e.
# PEASE UPVOTE\n\n# Complexity\n- Time complexity:O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public boolean isAcronym(List<String> words, String s) {\n        String res="";\n        for(int i=0;i<words.size();i++){\n            String g=words.get(i);\n            res+=g.charAt(0);\n        }\n        if(res.equals(s)){\n            return true;\n        }\n        return false;\n    }\n}\n```
['Array', 'String', 'Java']