🧠 100% Beat 🙌 || little Tricky soln ☠️
Intuition\ncomparigion i think best ......\n Describe your first thoughts on how to solve this problem. \n\n# Approach\ncompare words elements first charchter w
# Intuition\ncomparigion i think best ......\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\ncompare words elements first charchter with s (string) all character \norder important\n<!-- Describe your approach to solving the problem. -->\n\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        if(s.length()!=words.size()) return false;\n        int cnt = 0;\n        for(int i=0; i<words.size(); i++){\n            if(words.get(i).charAt(0)==s.charAt(i)) cnt++;\n        }\n        return cnt==s.length() ? true : false;\n    }\n}\n```\n![cat3.jpeg](https://assets.leetcode.com/users/images/dfe473aa-8741-43f0-8f13-5805ac005fcf_1701426398.8956902.jpeg)\n
['Java']