Beats 100% 0MS easy to understand
IntuitionApproach
if acronym and vector of words size not equal return false
loop, through the characters of acronym and match with the first character of the v
![image.png](https://assets.leetcode.com/users/images/63ea0d61-a29d-4802-8b5f-e79c752983c2_1743540006.8213606.png)

# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
1. if acronym and vector of words size not equal return false
2. loop, through the characters of acronym and match with the first character of the vector of string. 

# Complexity
- Time complexity:
Single for loop, $$O(n)$$

- Space complexity:
No extra space, $$O(1)$$

# Code
```cpp []
class Solution{
  public:
  bool isAcronym(std::vector<std::string>& words, std::string s){
    if(words.size() != s.size()){
      return false;
    }
    for(unsigned k{}; k<s.size(); k++){
      if(s[k]!=words[k][0]){
        return false;
      }
    }
    return true;
  }
};
```
['C++']