02. Mirror Words v1 js exam exec use

function solve(input) {
  const text = input.shift();
  const pattern = /([#@])(?<firstWord>[A-Za-z]{3,})\1{2}(?<secondWord>[A-Za-z]{3,})\1/g;

  const mirrorWords = [];
  let wordPairsCount = 0;
  let match = pattern.exec(text);

  while (match) {
    wordPairsCount++;
    const { firstWord, secondWord } = match.groups;
    const reversedFirstWord = firstWord.split('').reverse().join('');

    if (reversedFirstWord === secondWord) {
      mirrorWords.push(`${firstWord} <=> ${secondWord}`);
    }

    match = pattern.exec(text);
  }

  if (wordPairsCount < 1) {
    console.log('No word pairs found!');
  } else {
    console.log(`${wordPairsCount} word pairs found!`);
  }

  if (mirrorWords.length < 1) {
    console.log('No mirror words!');
  } else {
    console.log('The mirror words are:');
    console.log(mirrorWords.join(', '));
  }
}