📌Solution with shift() method
Intuition\n Describe your first thoughts on how to solve this problem. \n1. Remove the first item from the array words and returns that removed item;\n2. Reverc
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n1. Remove the first `item` from the array `words` and returns that removed `item`;\n2. Reverce letters in removed `item`;\n3. Determine whether the array `words` includes a reverce `item` among its entries;\n4. Repeat until the array `words` has elements.\n\n# Code\n```\n/**\n * @param {string[]} words\n * @return {number}\n */\nconst maximumNumberOfStringPairs = (words) => {\n  let num = 0;\n  while (words.length) {\n    let item = words.shift();\n    item = item[1] + item[0];\n    if (words.includes(item)) num++;\n  }\n  return num;\n}\n```
['JavaScript']