Tuesday, 10 September 2013

Given any string, add the least amount of characters possible to make it a palindrome in linear time

Given any string, add the least amount of characters possible to make it a
palindrome in linear time

I'm able to come up with multiple O(N^2) solns but am stumped with coming
up with an O(N) algo.
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)