Re:Can you solve it? The Greplin programming challenge
by orangecat on Friday October 08, 2010 @04:38PM
(#1773279)
Isn't brute force just O(n^3)? Loop over each character to start potential palindrome, loop from start character to end, reverse substring and compare. But yeah, the test input should be longer and/or smarter. Ditto on the third problem.
[ Parent
| on HN ]