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)].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)]Test Case 2:Expected Output:Enter·the·words·of·the·list·separated·by·space:·run speed walk goPairs·of·unique·indices·that·make·palindrome·are:·[]

"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."

Palindrome CountWrite a python program to count the number of palindrome strings that occurred in the given string. Input:The input consists of a string.Output:count number of palindrome stringsConstraints:1 < str < 10000Example:Input:madamOutput:2Explanation:NAPublic Test Cases:# INPUT EXPECTED OUTPUT1 madam2

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

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

Test time left: 33:41Write the codeTake the input as string from the user, If any permutation of the word is palindrome then return "True" or else return "False"For example : "carrace" should return "True", since it can be rearranged to form "racecar", which is a palindrome."daily" should return "False", since there's no rearrangement that can form a palindrome.Sample Test CasesTest Case 1:Expected Output:Enter·the·word:·dyyadaTrueTest Case 2:Expected Output:Enter·the·word:·carraceTrueTest Case 3:Expected Output:Enter·the·word:·daisyFalse