Problem of the day
The first line of input contains a single integer T, representing the number of test cases or queries to be run.
Then the T test cases follow.
The first and only line of each test case contains the elements of the linked list separated by a single space and terminated by -1. Hence, -1 would never be a list element.
For each test case, print “True” if the given linked list is a palindrome, else print “False”.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 10
1 <= N <= 5 * 10^4
-10^9 <= data <= 10^9 and data != -1
Where N is the number of nodes in the linked list and ‘data’ represents the value of the nodes of the list.
Time Limit: 1sec
3
1 2 2 1 -1
8 9 9 -1
4 -1
True
False
True
In the 1st test case, the given list is a palindrome.
In the 2nd test case, the given list is not a palindrome.
In the 3rd test case, the given list is a palindrome.
2
3 2 1 -1
1 1 1 -1
False
True