Simple Java Solution ||  Beats 100.00% of users with Java || 1ms
Intuition\n Describe your first thoughts on how to solve this problem. \ncheck only the first char of each string present in the list and validate.\n# Approach\
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\ncheck only the first char of each string present in the list and validate.\n# Approach\n<!-- Describe your approach to solving the problem. -->\nI tried to solve in 2 ways both are technically same but differ in representation.\n# Complexity\n- Time complexity: O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\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        int n = words.size(), m = s.length();\n\n        if(m != n)\n            return false;\n        for(int i =0; i<n; i++)\n            if(words.get(i).charAt(0) != s.charAt(i) )\n                return false;\n        \n\n        return true;\n        /*\n        2nd way\n        int i =0\n        for(char c : s.toCharArray())\n        {\n            if(words.get(i).charAt(0) != c)\n                return false;\n            i++;\n        }\n\n        return true;\n        */\n    }\n}\n```
['Java']