1MS || ✅🔥BEATS 100% PROOF🔥 || 💡CONCISE CODE✅ || 🌟JAVA || 🧑‍💻 BEGINNER FREINDLY
Code
![Screenshot 2025-01-13 173852.png](https://assets.leetcode.com/users/images/babcaaa5-30a2-47cc-b6e7-cb30232d06f8_1736914448.5616002.png)


# Code
```java []
class Solution {
    public boolean isAcronym(List<String> words, String s) {
        if (words.size() != s.length()) {
            return false;
        }

        // Compare each character `s` the first character of each word
        for (int i = 0; i < words.size(); i++) {
            if (s.charAt(i) != words.get(i).charAt(0)) {
                return false;
            }
        }

        return true;
    }
}
```
![7b3ed9e7-75a3-497e-85ef-237ed4f4fef7_1735690315.3860667.png](https://assets.leetcode.com/users/images/82d7d3fd-20a7-4858-bb96-bde0110c1479_1736914474.4494975.png)

['Java']