Easy solution 100% accurate
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: O(n) : where n is number of words \n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1) : constant \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        if(words.size() != s.length()) return false;\n        for(int i=0 ; i<words.size() ; i++){\n            String w = words.get(i);\n            if(s.charAt(i) != w.charAt(0)) return false;\n        }\n        return true;\n    }\n}\n```
['String', 'Java']