Javascript Program To Check If A Singly Linked List Is Palindrome
Last Updated : 09 Sep, 2024
Given a singly linked list of characters, write a function that returns true if the given list is a palindrome, else false.
METHOD 1 (Use a Stack)
- A simple solution is to use a stack of list nodes. This mainly involves three steps.
- Traverse the given list from head to tail and push every visited node to stack.
- Traverse the list again. For every visited node, pop a node from the stack and compare data of popped node with the currently visited node.
- If all nodes matched, then return true, else false.
Below image is a dry run of the above approach:
Below is the implementation of the above approach :
JavaScript // JavaScript program to check if // linked list is palindrome recursively class Node { constructor(val) { this.data = val; this.ptr = null; } } let one = new Node(1); let two = new Node(2); let three = new Node(3); let four = new Node(4); let five = new Node(3); let six = new Node(2); let seven = new Node(1); one.ptr = two; two.ptr = three; three.ptr = four; four.ptr = five; five.ptr = six; six.ptr = seven; let condition = isPalindrome(one); console.log("isPalidrome: " + condition); function isPalindrome(head) { let slow = head; let ispalin = true; let stack = []; while (slow != null) { stack.push(slow.data); slow = slow.ptr; } while (head != null) { let i = stack.pop(); if (head.data == i) { ispalin = true; } else { ispalin = false; break; } head = head.ptr; } return ispalin; } // This code is contributed by todaysgaurav Complexity Analysis:
- Time complexity: O(n), where n represents the length of the given linked list.
- Auxiliary Space: O(n), for using a stack, where n represents the length of the given linked list.
METHOD 2 (By reversing the list):
This method takes O(n) time and O(1) extra space.
- Get the middle of the linked list.
- Reverse the second half of the linked list.
- Check if the first half and second half are identical.
- Construct the original linked list by reversing the second half again and attaching it back to the first half
To divide the list into two halves, method 2 of this post is used.
When a number of nodes are even, the first and second half contains exactly half nodes. The challenging thing in this method is to handle the case when the number of nodes is odd. We don’t want the middle node as part of the lists as we are going to compare them for equality. For odd cases, we use a separate variable ‘midnode’.
JavaScript // Javascript program to check if // linked list is palindrome // Head of list let head; let slow_ptr, fast_ptr, second_half; // Linked list Node class Node { constructor(val) { this.data = val; this.next = null; } } // Function to check if given linked list // is palindrome or not function isPalindrome(head) { slow_ptr = head; fast_ptr = head; let prev_of_slow_ptr = head; // To handle odd size list let midnode = null; // Initialize result let res = true; if (head != null && head.next != null) { // Get the middle of the list. // Move slow_ptr by 1 and fast_ptrr // by 2, slow_ptr will have the middle node while (fast_ptr != null && fast_ptr.next != null) { fast_ptr = fast_ptr.next.next; // We need previous of the slow_ptr for // linked lists with odd elements prev_of_slow_ptr = slow_ptr; slow_ptr = slow_ptr.next; } // fast_ptr would become NULL when there are // even elements in the list and not NULL for // odd elements. We need to skip the middle // node for odd case and store it somewhere // so that we can restore the original list if (fast_ptr != null) { midnode = slow_ptr; slow_ptr = slow_ptr.next; } // Now reverse the second half and // compare it with first half second_half = slow_ptr; // NULL terminate first half prev_of_slow_ptr.next = null; // Reverse the second half reverse(); // compare res = compareLists(head, second_half); // Construct the original list back // Reverse the second half again reverse(); if (midnode != null) { // If there was a mid node (odd size case) // which was not part of either first half // or second half. prev_of_slow_ptr.next = midnode; midnode.next = second_half; } else prev_of_slow_ptr.next = second_half; } return res; } // Function to reverse the linked list. // Note that this function may change the // head function reverse() { let prev = null; let current = second_half; let next; while (current != null) { next = current.next; current.next = prev; prev = current; current = next; } second_half = prev; } // Function to check if two input // lists have same data function compareLists(head1, head2) { let temp1 = head1; let temp2 = head2; while (temp1 != null && temp2 != null) { if (temp1.data == temp2.data) { temp1 = temp1.next; temp2 = temp2.next; } else return false; } // Both are empty return 1 if (temp1 == null && temp2 == null) return true; //Will reach here when one is NULL // and other is not return false; } // Push a node to the linked list. // Note that this function changes the head function push(new_data) { // Allocate the Node & Put in the data let new_node = new Node(new_data); // link the old list of the new one new_node.next = head; // Move the head to point to new Node head = new_node; } // A utility function to point a // given linked list function printList(ptr) { let output = ""; while (ptr != null) { output += ptr.data + "->"; ptr = ptr.next; } console.log(output.trim() + "NULL"); } // Driver code // Start with the empty list let str = ['a', 'b', 'a', 'c', 'a', 'b', 'a']; let string = str.toString(); for (i = 0; i < 7; i++) { push(str[i]); printList(head); if (isPalindrome(head) != false) { console.log("Is Palindrome"); } else { console.log("Not Palindrome"); } } // This code is contributed by gauravrajput1 Outputa->NULL Is Palindrome b->a->NULL Not Palindrome a->b->a->NULL Is Palindrome c->a->b->a->NULL Not Palindrome a->c->a->b->a->NULL Not Palindrome b->a->c->a->b->a->NULL Not Palindrome a->b->a->c->a->b->a->NULL Is Palindrome
Complexity Analysis:
- Time Complexity: O(n)
- Auxiliary Space: O(1)
METHOD 3 (Using Recursion):
Use two pointers left and right. Move right and left using recursion and check for following in each recursive call.
- Sub-list is a palindrome.
- Value at current left and right are matching.
If both above conditions are true then return true.
The idea is to use function call stack as a container. Recursively traverse till the end of the list. When we return from the last NULL, we will be at the last node. The last node is to be compared with the first node of the list.
In order to access the first node of the list, we need the list head to be available in the last call of recursion. Hence, we pass head also to the recursive function. If they both match we need to compare (2, n-2) nodes. Again when recursion falls back to (n-2)nd node, we need a reference to 2nd node from the head. We advance the head pointer in the previous call, to refer to the next node in the list.
However, the trick is identifying a double-pointer. Passing a single pointer is as good as pass-by-value, and we will pass the same pointer again and again. We need to pass the address of the head pointer for reflecting the changes in parent recursive calls.
Thanks to Sharad Chandra for suggesting this approach.
JavaScript // Javascript program to implement // the above approach // Head of the list let head; let left; class Node { constructor(val) { this.data = val; this.next = null; } } // Initial parameters to this function // are &head and head function isPalindromeUtil(right) { left = head; // Stop recursion when right // becomes null if (right == null) return true; // If sub-list is not palindrome then // no need to check for the current // left and right, return false let isp = isPalindromeUtil(right.next); if (isp == false) return false; // Check values at current left and right let isp1 = (right.data == left.data); left = left.next; // Move left to next node; return isp1; } // A wrapper over isPalindrome(Node head) function isPalindrome(head) { let result = isPalindromeUtil(head); return result; } // Push a node to linked list. // Note that this function changes // the head function push(new_data) { // Allocate the node and // put in the data let new_node = new Node(new_data); // Link the old list of the // the new one new_node.next = head; // Move the head to point to new node head = new_node; } // A utility function to point a // given linked list function printList(ptr) { let output = ""; while (ptr != null) { output += ptr.data + "->"; ptr = ptr.next; } console.log(output.trim() + "NULL"); } // Driver Code let str = ['a', 'b', 'a', 'c', 'a', 'b', 'a']; for (let i = 0; i < 7; i++) { push(str[i]); printList(head); if (isPalindrome(head)) { console.log("Is Palindrome"); } else { console.log("Not Palindrome"); } } // This code is contributed by aashish1995 Outputa->NULL Is Palindrome b->a->NULL Not Palindrome a->b->a->NULL Is Palindrome c->a->b->a->NULL Not Palindrome a->c->a->b->a->NULL Not Palindrome b->a->c->a->b->a->NULL Not Palindrome a->b->a->c->a->b->a->NULL Is Palindrome
Complexity Analysis:
- Time Complexity: O(n)
- Auxiliary Space: O(n) if Function Call Stack size is considered, otherwise O(1).
Please refer complete article on Function to check if a singly linked list is palindrome for more details!
Similar Reads
JavaScript Linked List Programs
JavaScript Linked List Programs contain a list of articles based on programming. Linked List is a linear data structure that stores data in linearly connected nodes. Linked lists store elements sequentially, but doesn’t store the elements contiguously like an array. S. NoArticles1JavaScript Program
5 min read
Implementation of LinkedList in Javascript
In this article, we will be implementing the LinkedList data structure in Javascript. A linked list is a linear data structure where elements are stored in nodes, each containing a value and a reference (or pointer) to the next node. It allows for efficient insertion and deletion operations. Each no
5 min read
Javascript Program For Searching An Element In A Linked List
Write a function that searches a given key 'x' in a given singly linked list. The function should return true if x is present in linked list and false otherwise. bool search(Node *head, int x) For example, if the key to be searched is 15 and linked list is 14->21->11->30->10, then functi
3 min read
Javascript Program For Inserting A Node In A Linked List
We have introduced Linked Lists in the previous post. We also created a simple linked list with 3 nodes and discussed linked list traversal.All programs discussed in this post consider the following representations of the linked list. [GFGTABS] JavaScript // Linked List Class // Head of list let he
7 min read
Javascript Program For Inserting Node In The Middle Of The Linked List
Given a linked list containing n nodes. The problem is to insert a new node with data x at the middle of the list. If n is even, then insert the new node after the (n/2)th node, else insert the new node after the (n+1)/2th node. Examples: Input : list: 1->2->4->5 x = 3Output : 1->2->3
4 min read
Javascript Program For Writing A Function To Delete A Linked List
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers. This article focuses on writing a function to delete a linked list. Implementation: [GFGTABS] JavaScript // Javascript program to de
2 min read
Javascript Program For Deleting A Linked List Node At A Given Position
Given a singly linked list and a position, delete a linked list node at the given position. Example: Input: position = 1, Linked List = 8->2->3->1->7Output: Linked List = 8->3->1->7Input: position = 0, Linked List = 8->2->3->1->7Output: Linked List = 2->3->1-
3 min read
Javascript Program For Finding Length Of A Linked List
Write a function to count the number of nodes in a given singly linked list. For example, the function should return 5 for linked list 1->3->1->2->1. Iterative Solution: 1) Initialize count as 0 2) Initialize a node pointer, current = head.3) Do following while current is not NULL a) cur
3 min read
Javascript Program For Rotating A Linked List
Given a singly linked list, rotate the linked list counter-clockwise by k nodes. Where k is a given positive integer. For example, if the given linked list is 10->20->30->40->50->60 and k is 4, the list should be modified to 50->60->10->20->30->40. Assume that k is smal
5 min read
Javascript Program For Making Middle Node Head In A Linked List
Given a singly linked list, find middle of the linked list and set middle node of the linked list at beginning of the linked list. Examples: Input: 1 2 3 4 5 Output: 3 1 2 4 5Input: 1 2 3 4 5 6Output: 4 1 2 3 5 6 The idea is to first find middle of a linked list using two pointers, first one moves o
3 min read