News for hackers. Stuff that matters.
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.
Re:Can you solve it? The Greplin programming challenge by brown9-2 on Friday October 08, 2010 @04:49PM (#1773323)
reverse substring and compare

D'oh! My is_palindrome(word) just got a lot shorter, thanks :)