```python from typing import List, Tuple def find_longest_palindrome(text: str) -> str: """ Finds the longest palindromic substring within a given text. Args: text (str): The input string to search for palindromes. Returns: str: The longest palindromic substring found in the text. Examples: find_longest_palindrome("babad") == "bab" or "aba" find_longest_palindrome("cbbd") == "bb" """ longest_palindrome = "" for i in range(len(text)): # Check for odd-length palindromes l, r = i, i while l >= 0 and r < len(text) and text[l] == text[r]: if (r - l + 1) > len(longest_palindrome): longest_palindrome = text[l : r + 1] l -= 1 r += 1 # Check for even-length palindromes l, r = i, i + 1 while l >= 0 and r < len(text) and text[l] == text[r]: if (r - l + 1) > len(longest_palindrome): longest_palindrome = text[l : r + 1] l -= 1 r += 1 return longest_palindrome # Example usage input_string = "bananas" result = find_longest_palindrome(input_string) print(f"Longest palindrome in '{input_string}' is: {result}") ``` **Explanation:** This Python code implements an algorithm to find the longest palindromic substring within a given string. Here's a breakdown: 1. **Function Definition:** - `find_longest_palindrome(text: str) -> str`: Defines a function named `find_longest_palindrome` that takes a string `text` as input and returns the longest palindromic substring as a string. 2. **Initialization:** - `longest_palindrome = ""`: Initializes an empty string variable `longest_palindrome` to store the longest palindrome found so far. 3. **Iterating through the String:** - `for i in range(len(text))`: Loops through each character index (`i`) of the input string `text`. 4. **Checking for Palindromes:** - **Odd-Length Palindromes:** - `l, r = i, i`: Sets two pointers `l` and `r` both initially pointing to the current index `i`. - `while l >= 0 and r < len(text) and text[l] == text[r]`: Continues expanding outwards from the center `i` as long as: - `l` is within the string bounds (not negative). - `r` is within the string bounds (less than string length). - Characters at positions `l` and `r` are equal (indicating a palindrome). - `if (r - l + 1) > len(longest_palindrome)`: If the current palindrome (substring from `l` to `r`) is longer than the previously found `longest_palindrome`, update `longest_palindrome`. - `l -= 1; r += 1`: Moves the pointers one step inward and outward respectively to expand the palindrome check. - **Even-Length Palindromes:** - `l, r = i, i + 1`: Sets `l` to the current index `i` and `r` to the next index `i + 1`. - Similar logic as above, but expands outwards with `l` moving left and `r` moving right. 5. **Returning the Result:** - `return longest_palindrome`: After checking all possible centers and expansions, returns the `longest_palindrome` found. Let me know if you'd like me to explain any specific part in more detail!