Given a list of words, find all pairs of unique indices such that the concatenation of the two words is a palindrome.For example,given the list ["code", "edoc", "da", "d"], return [(0, 1), (1, 0), (2, 3)].Sample Test CasesTest Case 1:Expected Output:Enter·the·words·of·the·list·separated·by·space:·code edoc da dPairs·of·unique·indices·that·make·palindrome·are:·[(0,·1),·(1,·0),·(2,·3)]

concatenation of the two wordsGiven a list of words, find all pairs of unique indices such that the concatenation of the two words is a palindrome.For example,given the list ["code", "edoc", "da", "d"], return [(0, 1), (1, 0), (2, 3)].

Given a string, discover all non-single letter palindrome substrings.

"Please create a pseudocode function that will check if all the words in an array are palindromes. For example, an input of ['racecar', 'noon', 'civic'] should return True, but an input of ['racecar', 'shoe', 'moon'] should return False."

Given a string s and a list of words words, where each word is the same length, find all starting indices of substrings in s that is a concatenation of every word in words exactly once.For example, given s = "dogcatcatcodecatdog" and words = ["cat", "dog"], return [0, 13], since "dogcat" starts at index 0 and "catdog" starts at index 13.Given s = "barfoobazbitbyte" and words = ["dog", "cat"], return -1 since there are no substrings composed of "dog" and "cat" in s.Tescase 1:Input:dogcatcatcodecatdog  // string2  // number of wordscat dog  // words separated by spaceOutput:[0, 13]Testcase 2:Input:barfoobazbitbyte  // string2  // number of wordscat dog  // words separated by spaceOutput:-1

Given a linked list with string data, check whether the combined string formed is palindrome. If the combined string is palindrome then return true otherwise return false.Example:Input:Output : trueExplanation: As string "abcddcba" is palindrome the function should return true.Input:Output : falseExplanation: As string "abcdba" is not palindrome the function should return false.Expected Time Complexity:  O(n)Expected Auxiliary Space: O(n)Constraints:1 <= Node.data.length<= 1031<=list.length<=103