Palindrome Linked List
Try to solve the Palindrome Linked List problem.
We'll cover the following
Statement
Given the head of a linked list, your task is to check whether the linked list is a palindrome or not. Return TRUE if the linked list is a palindrome; otherwise, return FALSE.
Note: The input linked list prior to the checking process should be identical to the list after the checking process has been completed.
Constraints:
Let n
be the number of nodes in a linked list.
-
n
-
Node.value
.
Examples
We can understand the problem better after looking at the illustration below:
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy