Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
|
from
login
O(n) algorithm to find longest palindromic substring w/o suffix trees
(
wcipeg.com
)
58 points
by
dhruvbird
on April 8, 2012
|
past
|
17 comments
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
