subpalindr = (lambda text:
    max((
        (text[i:j], i, j)
            for i in range(len(text))
                for j in range(1+i, len(text))
                    if (text[i:j] == text[i:j][::-1])),
        key=lambda l: len(l[0]))[1:])

def subpalindr(text):
    text = text.lower()
    reversed_text = text[::-1]
    
    results = {}
    for a in range(len(text)-1):
        for b in range(a+1, len(text)):
            if text[a:b] in reversed_text:
                results[b-a] = results.get(b-a, []) + [text[a:b]]
                
    return results[max(results.keys())]

for b in range(a+1, len(text)+1):
    if text[a:b] == text[a:b][::-1]:

subpalindr = (lambda text:
    __import__("functools").reduce(lambda x, y: x if (len(x[0]) > len(y[0])) else y,
        ((text[i:j], i, j)
            for i in range(len(text))
                for j in range(1+i, len(text))
                    if (text[i:j] == text[i:j][::-1])))[1:])

>>> subpalindr("123aba456")
(0, 2)

def subpalindr(text, min_len=3):
    text = text.lower()
    
    results = {}
    for a in range(len(text)):
        for b in range(a+min_len, len(text)+1):
            if text[a:b] == text[a:b][::-1]:
                results[b-a] = results.get(b-a, []) + [(a,b)]
                
    if results:
        return results[max(results)]

def palindr(text)
    return text == text[::-1]

...

for i in range(len(text)):
    for j in range(i+1, len(text)):
        if palindr(text[i:j]):

...

     
    for i in range(len(text))
TypeError: reduce() of empty sequence with no initial value

Process finished with exit code 1

 for j in range(1+i, len(text)+1) 

if results:
  return results[max(results)][0] 

subpalindr = (lambda text:
    __import__("functools").reduce(lambda x, y: x if (len(x[0]) > len(y[0])) else y,
        ((text[i:j], i, j)
            for i in range(len(text)+1)
                for j in range(1+i, len(text)+1)
                    if (text[i:j] == text[i:j][::-1])),
         ("", 0, 0))[1:])

from itertools import islice, combinations as comb

def subpali(text, min_len=3):
    text = text.lower()

    def text_range_ispali(r):
        a, b = r
        return text[a:b] == text[b-1:a-1:-1]
 
    def range_len(r):
        a, b = r
        return b - a
    
    ranges_combinations = comb(range(len(text)+1), 2)
    sorted_ranges = sorted(ranges_combinations, key=range_len, reverse=True)
    
    for r in sorted_ranges:
        if range_len(r) >= min_len:
            if text_range_ispali(r):
                yield r
        else:
            break

text = '''
    Финский язык:
        Saippuakivikauppias (самое длинное в мире слово-палиндром)
    Греческий язык:
        Νίψον ανομηματα μη μοναν οψίν («Смой грехи, не только лицо»)
'''

text = text.replace(' ', '')
palis_count = 4
for a, b in islice(subpali(text), palis_count):
    print((a,b), repr(text[a:b]))

(83, 108) 'Νίψονανομηματαμημονανοψίν'
(84, 107) 'ίψονανομηματαμημονανοψί'
(85, 106) 'ψονανομηματαμημονανοψ'
(14, 33) 'Saippuakivikauppias'

def subpalindr(text, min_len=3):
    text = text.lower()
    for length in range(len(text)+1, min_len-1, -1):
        for offset in range(len(text)+1 - length):
            a = offset
            b = offset+length
            if text[a:b] == text[a:b][::-1]:
                return a, b

def palindrome(s):
    s = s.lower().replace(' ', '')
    result = ''
    for i in range(0, len(s)):
        for j in range(i + 1, len(s)):
            if s[i:j] == s[i:j][::-1] and (j - i) > len(result):
                result = s[i:j]
    return result

text = 'Saippuakivikauppias (самое длинное в мире)'.lower()


def find_palindromon(text):
    """ """
    result = (0, 0, 0)
    a = []
    for i, m in enumerate(text):
        a.append([])
        for j, n in enumerate(text[::-1]):
            a[i].append(0 if m != n else a[i - 1][j - 1] + 1 if i and j else 1)
            if a[i][j] >= result[2]:
                result = (i, j, a[i][j])

    return (result[0] + 1 - result[2], result[2]) if result[2] > 1 else (0, 0)


pos, length = find_palindromon(text)
print(pos, length, text[pos: pos + length])

0 19 saippuakivikauppias

find_palindromon('Saippuakivi vikauppias')

12 10 vikauppias

def find_palindromon(text):
    """ """
    result = (0, 0, 0)
    results = []
    a = []
    for i, m in enumerate(text):
        a.append([])
        for j, n in enumerate(text[::-1]):
            a[i].append(0 if m != n else a[i - 1][j - 1] + 1 if i and j else 1)
            if a[i][j] >= result[2]:
                result = (i, j, a[i][j])
                if a[i][j] > 1:
                    results.append(result)

    for r in results[::-1]:
        pos, l = (r[0] + 1 - r[2], r[2])
        if (text[pos: pos + l] == text[pos: pos + l][::-1]):
            return (pos, l)

    return (0, 0)

def subpalindr(text): #first version
    try:
        l=len(text)
        text=text.lower()
        result=[]
        for i in range(l):
            result+=[(i,j+1) for j in range(i+2,l) if text[i: (j + 1)].replace(' ', '').isalpha() \
            and  text[i: (j + 1)].replace(' ', '') == text[i:(j + 1)][::-1].replace(' ', '')]  
        k=max(result, key=lambda a: a[1] - a[0])
        return text[k[0]:k[1]],k if len(text[k[0]:k[1]].strip())>2 else (0,0)
    except:
        return "Empty string!"

print(subpalindr('somethingra123 c e12car going'))
print(subpalindr('123 a ba123'))
print(subpalindr('123 aba 123'))
print(subpalindr('Mad am I ma dam.'))
print(subpalindr('somethin rac e car going'))
print(subpalindr(''))


(' c ', (0, 0))
(' a ba', (3, 8))
(' aba ', (3, 8))
('mad am i ma dam', (0, 15))
(' rac e car ', (8, 19))
Empty string!

Process finished with exit code 0

except:
    return "Empty string!"

print(subpalindr('qwASDFGerGFDSAty'))

No palindrome

Process finished with exit code 0