Each palindrome can be always created from the other palindromes, if a single character is also a palindrome. For example, the string "bobseesanna" can be created by some ways:* bobseesanna = bob + sees + anna* bobseesanna = bob + s + ee + s + anna* bobseesanna = b + o + b + sees + a + n + n + a...We want to take the value of function CountPal(s) which is the number of different ways to use the palindromes to create the string s by the above method.InputThe string sOutputThe value of function CountPal(s), taking the modulo of 1 000 000 007 (109+7)Limitations0 < |s| <= 1000Sample 1:InputOutputbobseesanna18

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 strings

Your friend is in university and there is a coding challenge going on. A string S of lowercase letters is displayed over the screen. The length of the string is N. An integer M is also displayed over the screen.Your task is write a program to determine if we can make the string Palindrome by performing at most M operations on the provided string

Given a string, find the minimum number of characters to be inserted to convert it to a palindrome.Examples :Input: str = "abcd"Output: 3Explanation: Inserted character marked with bold characters in dcbabcd, here we need minimum three characters to make it palindrome.

A string game is played by the children in a primary school.Given a string S , the children must check if it is a palindrome.A palindrome is a word, phrase, or sequence that reads the same backward as forward.If  S is a palindrome , then the children must say the number of characters in that string.If S is not a palindrome , then the children must say the reverse of the string.Write a function game and implement the above scenario.

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)]