Write an algorithm to find the longest palindrome substring in a given string.

In a string s, the last character is at the index len(s)-1. True False

Given a string, check whether it is a panagram or not.A panagram is a sentence that uses every letter at least once.The most famous example is: "he quick brown fox jumps over the lazy dog.Note:A panagram in one language isn't necessarily a panagram in another. Thismodule assumes the english language. Hence, the Finnish panagram'Törkylempijävongahdus' won't pass for a panagram despite being considereda perfect panagram in its language. However, the Swedish panagram'Yxmördaren Julia Blomqvist på fäktning i Schweiz' will pass despiteincluding letters not used in the english alphabet. This is because theSwedish alphabet only extends the Latin one.""" from string import ascii_lowercase def panagram(string):    """    Returns whether the input string is an English panagram or not.        Parameters:            string (str): A sentence in the form of a string.        Returns:.

Given a string, check whether it is a panagram or not.A panagram is a sentence that uses every letter at least once.The most famous example is: "he quick brown fox jumps over the lazy dog.Note:A panagram in one language isn't necessarily a panagram in another. Thismodule assumes the english language. Hence, the Finnish panagram'Törkylempijävongahdus' won't pass for a panagram despite being considereda perfect panagram in its language. However, the Swedish panagram'Yxmördaren Julia Blomqvist på fäktning i Schweiz' will pass despiteincluding letters not used in the english alphabet. This is because theSwedish alphabet only extends the Latin one.""" from string import ascii_lowercase def panagram(string):    """    Returns whether the input string is an English panagram or not.        Parameters:            string (str): A sentence in the form of a string.        Returns:.