Hướng dẫn how do you find all palindromes in a string in python? - làm thế nào để bạn tìm thấy tất cả các palindromes trong một chuỗi trong python?

Thử thách mã hóa

Thử thách: Cho một chuỗi. Làm thế nào để tìm tất cả palindromes trong chuỗi?Challenge: Given a string. How to find all palindromes in the string?

Để hiểu được, cho phép tôi nhanh chóng thêm một định nghĩa về thuật ngữ palindrom:

Định nghĩa: Một palindrom là một chuỗi các ký tự đọc cùng lùi như về phía trước như 'madam', 'anna' hoặc '101'.Definition: A palindrome is a sequence of characters that reads the same backward as forward such as 'madam', 'anna', or '101'.

Bài viết này muốn cung cấp cho bạn một giải pháp nhanh chóng và dễ dàng trong Python. Đầu tiên, chúng tôi sẽ giải quyết vấn đề dễ dàng nhưng quan trọng hơn là kiểm tra xem một chất nền có phải là một palindrom ở nơi đầu tiên không:

Cách kiểm tra xem chuỗi có phải là palindrom không

Bạn có thể dễ dàng kiểm tra xem một chuỗi là một palindrom bằng cách sử dụng biểu thức cắt word == word[::-1] đánh giá thành True nếu từ này giống nhau về phía trước và ngược, tức là, nó là một palindrom.

Hướng dẫn được đề xuất: Python Palindromes One-LinerRecommended Tutorial: Python Palindromes One-Liner

Tiếp theo, chúng tôi sẽ khám phá cách tìm tất cả các chuỗi con trong chuỗi Python cũng là palindromes. Bạn có thể tìm thấy trình kiểm tra palindrom của chúng tôi trong giải pháp mã (được tô sáng):

Tìm tất cả các nền tảng là palindrom

Cách tiếp cận vũ phu để tìm kiếm tất cả các palindromes trong một chuỗi là lặp lại tất cả các chuỗi con trong một vòng lặp ____10 được lồng nhau. Sau đó kiểm tra từng chuỗi con nếu nó là một palindrom sử dụng word == word[::-1]. Theo dõi các palindromes được tìm thấy bằng phương pháp

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Ở đây, giải pháp đầy đủ:

def find_palindromes(s):
    palindromes = []
    n = len(s)
    for i in range(n):
        for j in range(i+1,n+1):
            word = s[i:j]
            if word == word[::-1]:
                palindromes.append(word)          
    return palindromes


print(find_palindromes('locoannamadam'))
# ['l', 'o', 'oco', 'c', 'o', 'a', 'anna',
#  'n', 'nn', 'n', 'a', 'ama', 'm', 'madam',
#  'a', 'ada', 'd', 'a', 'm']

print(find_palindromes('anna'))
# ['a', 'anna', 'n', 'nn', 'n', 'a']

print(find_palindromes('abc'))
# ['a', 'b', 'c']

Độ phức tạp thời gian chạy

Điều này có độ phức tạp thời gian chạy khối, tức là, đối với một chuỗi có độ dài

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Giải pháp thời gian chạy bậc hai

đây là điều tốt nhất mà chúng ta có thể làm sao? Không! Có một giải pháp thời gian O (N²)!

Ở đây, một giải pháp raptime bậc hai để tìm tất cả các palindromes trong một chuỗi nhất định bỏ qua các palindromes một ký tự tầm thường (được sửa đổi đáng kể từ nguồn):

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Vui lòng tham gia cộng đồng những người học đầy tham vọng của chúng tôi như bạn (chúng tôi cũng có những tấm che

Trong khi làm việc như một nhà nghiên cứu trong các hệ thống phân tán, Tiến sĩ Christian Mayer đã tìm thấy tình yêu của mình đối với việc dạy các sinh viên khoa học máy tính.

Để giúp học sinh đạt được thành công cao hơn của Python, ông đã thành lập trang web giáo dục chương trình Finxter.com. Ông là tác giả của cuốn sách lập trình phổ biến Python Oneer (Nostarch 2020), đồng tác giả của loạt sách Break Break Python, những cuốn sách tự xuất bản, người đam mê khoa học máy tính, freelancer và chủ sở hữu của một trong 10 blog Python lớn nhất trên toàn thế giới.

Niềm đam mê của ông là viết, đọc và mã hóa. Nhưng niềm đam mê lớn nhất của anh là phục vụ các lập trình viên đầy tham vọng thông qua Finxter và giúp họ tăng cường các kỹ năng của họ. Bạn có thể tham gia học viện email miễn phí của anh ấy ở đây.

Đưa ra một chuỗi các ký tự ASCII viết thường, tìm tất cả các chuỗi phụ liên tục khác biệt của nó. & NBSP;

Examples: 

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Phương pháp 1:

Bước 1: Tìm tất cả các palindromes bằng thuật toán của Manacher đã sửa đổi: & nbsp; coi mỗi ký tự như một trục, mở rộng ở cả hai bên để tìm độ dài của cả hai palindromes chẵn và lẻ tập trung vào ký tự trục tập dưới mức xem xét và lưu trữ độ dài trong 2 mảng (ODD & chẵn). 
Considering each character as a pivot, expand on both sides to find the length of both even and odd length palindromes centered at the pivot character under consideration and store the length in the 2 arrays (odd & even). 
Time complexity for this step is O(n^2)

Bước 2: Chèn tất cả các palindromes được tìm thấy trong một hashmap: & nbsp; chèn tất cả các palindromes được tìm thấy từ bước trước đó vào một hashmap. Cũng chèn tất cả các ký tự riêng lẻ từ chuỗi vào hashmap (để tạo ra các chuỗi phụ đơn lẻ khác nhau . Lưu ý rằng có thể có nhiều nhất là các chuỗi phụ O (N^2) của một chuỗi. Trong mã C ++ dưới đây được đặt hàng HashMap được sử dụng trong đó độ phức tạp của thời gian chèn và tìm kiếm là o (logn). Trong C ++, HashMap được đặt hàng được triển khai bằng cây đen màu đỏ. 
Insert all the palindromes found from the previous step into a HashMap. Also insert all the individual characters from the string into the HashMap (to generate distinct single letter palindromic sub-strings). 
Time complexity of this step is O(n^3) assuming that the hash insert search takes O(1) time. Note that there can be at most O(n^2) palindrome sub-strings of a string. In below C++ code ordered hashmap is used where the time complexity of insert and search is O(Logn). In C++, ordered hashmap is implemented using Red Black Tree.

Bước 3: In các palindromes riêng biệt và số lượng các palindromes riêng biệt như vậy: & nbsp; bước cuối cùng là in tất cả các giá trị được lưu trữ trong hashmap (chỉ các phần tử riêng biệt sẽ được băm do tính chất của hashmap). Kích thước của bản đồ cho số lượng các chuỗi phụ liên tục palindromic riêng biệt. 
The last step is to print all values stored in the HashMap (only distinct elements will be hashed due to the property of HashMap). The size of the map gives the number of distinct palindromic continuous sub-strings.

Dưới đây là việc thực hiện ý tưởng trên.

C++

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'2'madam'8 'anna'4

'anna'5'anna'6

'anna'2'anna'8

'anna'2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'2'madam'8 '101'4

'anna'2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'5'101'8

'anna'5word == word[::-1]0

'anna'2word == word[::-1]2

'anna'2word == word[::-1]4

'anna'2word == word[::-1]6

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

word == word[::-1]2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

word == word[::-1]2

Java

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

'anna'2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2'madam'8 'madam'9

'anna'2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'5'madam'8

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'5'anna'8

'anna'5

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'5'madam'8 '101'4

'anna'5

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'5word == word[::-1]2

'anna'5

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

'anna'5word == word[::-1]6

'anna'2word == word[::-1]2

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'2

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

'anna'5

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

'anna'2

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

word == word[::-1]2

Python3

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

Các

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2'madam'8

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

'anna'5

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

'anna'2

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

'anna'2'madam'8

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Các

'anna'5

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

'anna'2

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

Is

'anna'5'madam'23

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

C#

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'2'anna'24

'anna'2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'2'madam'8 'madam'9

'anna'2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'5'madam'8 'anna'4

'anna'5'anna'37

'anna'5'anna'39

'anna'5

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'5'madam'8 'anna'45

'anna'5

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'5word == word[::-1]2

'anna'5'anna'55

'anna'5word == word[::-1]6

'anna'2word == word[::-1]2

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2'anna'68

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2'anna'72

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'2

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'5'anna'65 'anna'94

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'5'anna'70

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'2word == word[::-1]2

'anna'2'anna'65 '101'05

'anna'5'101'07

'anna'2'anna'70

'anna'5'101'11

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Các

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

word == word[::-1]2

JavaScript

'101'47

'101'48 '101'49

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'2'madam'8 'anna'4

'anna'5'anna'6

'anna'2'anna'8

'anna'2'101'98

'anna'2'madam'8 '101'4

'anna'2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'5word == word[::-1]05

'anna'5word == word[::-1]0

'anna'2word == word[::-1]2

'anna'2word == word[::-1]11

'anna'2word == word[::-1]6

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

'anna'2word == word[::-1]2

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

word == word[::-1]2

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

word == word[::-1]58

Output:  

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

Phương pháp 2:

Chiều dài chuỗi - n

Bước 1: Tìm tất cả các chuỗi phụ palindromic

& nbsp; & nbsp; & nbsp; & nbsp; & nbsp; Đầu tiên cho mọi kiểm tra chuỗi con nếu nó là palindrom hoặc không sử dụng lập trình động như thế này-https://www.geeksforgeek.org/count-motindrom-sub-string-string/First for every sub-string check if it is palindrome or not using dynamic programming like this – https://www.geeksforgeeks.org/count-palindrome-sub-strings-string/

& nbsp; & nbsp; & nbsp; & nbsp; Độ phức tạp về thời gian - O (N2) & NBSP; và & nbsp; Độ phức tạp không gian - O (N2)

Bước 2: Loại bỏ các palindromes trùng lặp

& nbsp; & nbsp; & nbsp; & nbsp; & nbsp; Đối với mọi chỉ mục bắt đầu từ INDEX 0, chúng tôi sẽ sử dụng thuật toán KMP và kiểm tra xem tiền tố và hậu tố có giống nhau không và là palindrom thì chúng tôi sẽ đặt 0 mảng dp cho chuỗi phụ hậu tố đóFor every index starting from index 0 we will use KMP algorithm and check if prefix and suffix is same and is palindrome then we will put 0 the dp array for that suffix sub-string

& nbsp; & nbsp; & nbsp; & nbsp; Độ phức tạp thời gian O (N2) & NBSP; & nbsp; và & nbsp; Độ phức tạp không gian O (N) cho mảng KMP

Bước 3: In các palindromes riêng biệt và số lượng palindromes như vậy

& nbsp; & nbsp; & nbsp; & nbsp; & nbsp; cho mỗi kiểm tra chuỗi con nếu nó có trong mảng dp (tức là dp [i] [j] == true) và in nó.For every sub-string check if it is present in dp array (i.e dp[i][j] == true) and print it.

& nbsp; & nbsp; & nbsp; & nbsp; Độ phức tạp thời gian O (N2) & NBSP; và & nbsp; & nbsp; độ phức tạp không gian o (n)

Độ phức tạp về thời gian tổng thể - O (N2)

Độ phức tạp không gian tổng thể - O (N2)

Dưới đây là việc thực hiện ý tưởng trên.

C++

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

word == word[::-1]60

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

Các

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2word == word[::-1]89

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'2'anna'65 True06

'anna'5True08

'anna'5True10True11

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2word == word[::-1]2

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2'anna'65 True36

'anna'5True38word == word[::-1]76

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'5True42

'anna'2word == word[::-1]2

'anna'2'anna'70 'anna'65 True48

'anna'5True50

'anna'2word == word[::-1]2

'anna'2'anna'70

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'5True57

'anna'2word == word[::-1]2

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

'anna'2True80

'anna'2'anna'65 True83

'anna'5True85

'anna'5True87True88

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

'anna'2word == word[::-1]2

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

True99

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

word == word[::-1]2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

word == word[::-1]2

Java

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

'anna'2

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

 Below are 5 palindrome sub-strings
a
aa
aaa
aba
b 

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

word == word[::-1]2

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

a
aba
b
aa
aaa
Total number of distinct palindromes is 5
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaa
aaaaaaaaa
aaaaaaaaaa
Total number of distinct palindromes is 10

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

Input: str = "abaaa"
Output:  Below are 5 palindrome sub-strings
a
aa
aaa
aba
b


Input: str = "geek"
Output:  Below are 4 palindrome sub-strings
e
ee
g
k

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []

def find_palindromes(s, j, k):
    ''' Finds palindromes in substring between indices j and k'''
    palindromes = []
    while j >= 0 and k < len(s):
        if s[j] != s[k]:
            break
        palindromes.append(s[j: k + 1])
        j -= 1
        k += 1
    return palindromes


def find_all(s):
    '''Finds all palindromes (non-trivial) in string s'''
    palindromes = []
    for i in range(0, len(s)):
        palindromes.extend(find_palindromes(s, i-1, i+1))
        palindromes.extend(find_palindromes(s, i, i+1))
    return palindromes


print(find_all('locoannamadam'))
# ['oco', 'nn', 'anna', 'ama', 'ada', 'madam']

print(find_all('anna'))
# ['nn', 'anna']

print(find_all('abc'))
# []