Longest Palindromic Substring

Given a string of length $n$ , find the palindromic substrings of maximal length.

Parameters

$n$ : length of given string

Related Problems

Longest Palindromic Substring

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 5 of 5 algorithms

				See more
Gusfield	1997	$O(n)$	$O(n)$
Jeuring	1994	$O(n)$	$O(n)$
Manacher	1975	$O(n)$	$O(n)$
Dynamic Programming	1953	$O(n^2)$	$O(n^2)$
Naive	1940	$O(n^3)$	$O(1)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table