Hi everyone, I was recently asked a question to find the most optimal solution to finding if a given number 'n' is a palindrome or not.
I suggested reversing the first half of the number and comparing it with the second half, giving complexity O (n/2). He still seemed unsatisfied and wanted me to further optimize it. Any clues on how to optimize this simple question further!? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
