MirrorWords-JS

function solve(input) {
    let pattern = /([@#])(?<firstWord>[A-Za-z]{3,})\1\1(?<secondWord>[A-Za-z]{3,})\1/g;
    let string = input.shift()
    let result = pattern.exec(string)
    let pairs = 0;
    let mirrorWords = {}
    while (result !== null) {
        pairs++;
        let firstWord = result.groups['firstWord']
        let secondWord = result.groups['secondWord']
        if (firstWord == secondWord.split('').reverse().join('')) {
            mirrorWords[firstWord] = secondWord
        }
        result = pattern.exec(string)
    }
    if (pairs > 0) {
        console.log(`${pairs} word pairs found!`);
    }
    else {
        console.log("No word pairs found!");
    }
    if (Object.keys(mirrorWords).length > 0) {
        console.log(`The mirror words are:`);
        let arr = Object.entries(mirrorWords)
        let emptyArr = []
        arr.forEach(element => {
            emptyArr.push(`${element[0]} <=> ${element[1]}`);
        });
        console.log(emptyArr.join(', '));
    }
    else {
        console.log(`No mirror words!`);
    }
}