Is it possible to get the length of biggest substring which is palindrome on a string on O(n)?? - Codeforces

→ Pay attention

Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
3 days
Register now »

*has extra registration

→ Top rated

#	User	Rating
1	tourist	4009
2	jiangly	3823
3	Benq	3738
4	Radewoosh	3633
5	jqdai0815	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	ksun48	3390
10	gamegame	3386

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	167
2	Um_nik	163
2	maomao90	163
4	atcoder_official	161
5	adamant	159
6	-is-this-fft-	158
7	awoo	157
8	TheScrasse	154
9	nor	153
9	Dominater069	153

View all →

→ Find user

→ Recent actions

Detailed →

Is it possible to get the length of biggest substring which is palindrome on a string on O(n)??

Revision en1, by Secret.Codes, 2017-07-26 07:39:47

Is it possible to get the length of biggest substring which is palindrome on a string on O(n)??

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en1		Secret.Codes	2017-07-26 07:39:47	194	Initial revision (published)