Unique pairs in array that forms palindrome words in JavaScript

Problem

We are required to write a JavaScript function that takes in an array of unique words.

Our function should return an array of all such index pairs, the words at which, when combined yield a palindrome word.

Example

Following is the code −

 Live Demo

const arr = ["abcd", "dcba", "lls", "s", "sssll"];
const findPairs = (arr = []) => {
   const res = [];
   for ( let i = 0; i < arr.length; i++ ){
      for ( let j = 0; j < arr.length; j++ ){
         if (i !== j ) {
            let k = `${arr[i]}${arr[j]}`;
            let l = [...k].reverse().join('');
            if (k === l)
            res.push( [i, j] );
         }
      };
   };
   return res;
};
console.log(findPairs(arr));

Output

[ [ 0, 1 ], [ 1, 0 ], [ 2, 4 ], [ 3, 2 ] ]

AmitDiwan

Published on 19-Apr-2021 11:17:08

• Related Questions & Answers
• Counting adjacent pairs of words in JavaScript
• Joining strings to form palindrome pairs in JavaScript
• Palindrome array - JavaScript
• Maximum length product of unique words in JavaScript
• JavaScript function that should count all unique items in an array
• Making array unique in JavaScript
• Count of pairs in an array that have consecutive numbers using JavaScript
• Unique Morse Code Words in Python
• Finding peculiar pairs in array in JavaScript
• Count palindrome words in a sentence in C++
• Beginning and end pairs in array - JavaScript
• Find all triplets in a sorted array that forms Geometric Progression in C++
• Filtering array to contain palindrome elements in JavaScript
• Summing up unique array values in JavaScript
• Order an array of words based on another array of words JavaScript