Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

This is pretty small and trivial, but I'm trying to implement DP problems in Haskell just to get some more practice with it. I'm stuck on Manacher's algorithm for finding longest palindromic substrings


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: