/2011/12/01/programming-interview-questions-19-find-next-palindrome-number/?utm_source=rss&utm_medium=rss&utm_campaign=programming-interview-questions-19-find-next-palindrome-number Information Retrieval and Machine Learning Mon, 23 Jan 2012 19:14:24 +0000 hourly 1 http://wordpress.org/?v=3.3 /2011/12/01/programming-interview-questions-19-find-next-palindrome-number/#comment-682 Arden Tue, 06 Dec 2011 05:44:14 +0000 /?p=841#comment-682 Thanks for the notice Arda, updated the article. Thanks for the notice Arda, updated the article.

]]> /2011/12/01/programming-interview-questions-19-find-next-palindrome-number/#comment-677 Arda Antikacioglu Mon, 05 Dec 2011 21:30:59 +0000 /?p=841#comment-677 Actually, this takes O(log(n)) time since mirroring takes as long as the length of n, which is still linear in the length of the input and can be proven to be optimal. Actually, this takes O(log(n)) time since mirroring takes as long as the length of n, which is still linear in the length of the input and can be proven to be optimal.

]]>