Given a linked list with node as given below:
struct node
{
char info;
struct node *next;
}
Give an O(n) algorithm to find if its a palindrome or not? You can not use more than O(1) space.
Two pointers to explore the list, reach the mid-point reverse the first half and compare the two halves
Posts
9 months ago
No comments:
Post a Comment