You are given a singly Linked List of integers. Your task is to return true if the given singly linked list is a palindrome otherwise returns false.
The given linked list is 1 -> 2 -> 3 -> 2-> 1-> NULL.
It is a palindrome linked list because the given linked list has the same order of elements when traversed forwards and backward.
Can you solve the problem in O(N) time complexity and O(1) space complexity iteratively?
Sample Input 1 :
1 2 3 4 5 6 -1
1 2 1 -1
Sample Output 1 :
Explanation for sample 1:
For the first test case, it is not a palindrome because Linked List doesn't have the same order of elements when traversed forwards and backwards.
For the second test case, it is a palindrome linked list because a Linked List has the same order of elements when traversed forwards and backwards.
Sample Input 2 :
1 10 45 10 1 -1
Sample Output 2 :