JavaScript | O(n) | Beats 93.91% | Best Practice Approach
Complexity\n- Time complexity: O(n)\n\n- Space complexity: O(1)\n\n# Code\njavascript []\n/**\n * @param {string[]} words\n * @param {string} s\n * @return {boo
# Complexity\n- Time complexity: $$O(n)$$\n\n- Space complexity: $$O(1)$$\n\n# Code\n```javascript []\n/**\n * @param {string[]} words\n * @param {string} s\n * @return {boolean}\n */\nvar isAcronym = function (words, s) {\n  if (words.length !== s.length) return false;\n\n  for (let i = 0; i < words.length; i++) {\n    if (words[i][0] !== s[i]) return false;\n  }\n\n  return true;\n};\n```
['Array', 'String', 'JavaScript']