Mirror Words [JavaScript]

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

    let mirrorWords = [];
    let match;
    let counterForValidPairs = 0;

    while ((match = pattern.exec(text)) !== null) {
        counterForValidPairs++;

        let { firstWord, secondWord } = match.groups;
        let reversedFirstWord = firstWord.split('').reverse().join('');

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

    if (counterForValidPairs == 0) {
        console.log("No word pairs found!");
    } else {
        console.log(`${counterForValidPairs} word pairs found!`);
    }

    if (mirrorWords.length > 0) {
        console.log(`The mirror words are:`);
        console.log(mirrorWords.join(', '));
    } else {
        console.log("No mirror words!");
    }
}