Given a singly linked list of size N of integers. The task is to check if the given linked list is palindrome or not.
Expected Time Complexity: O(N)
Expected Auxialliary Space Usage: O(1) (ie, you should not use the recursive stack space as well)
Input:
First line of input contains number of testcases T. For each testcase, first line of input contains length of linked list N and next line contains N integers as data of linked list.
Output:
For each test case output will be 1 if the linked list is a palindrome else 0.
User Task:
The task is to complete the function isPalindrome() which takes head as reference as the only parameter and returns true or false if linked list is palindrome or not respectively.
Constraints:
1 <= T <= 103
1 <= N <= 50
Example:
Input:
2
3
1 2 1
4
1 2 3 4
Output:
1
0
Explanation:
Testcase 1: The given linked list is 1 2 1 , which is a pallindrome and Hence, the output is 1.
Testcase 2: The given linked list is 1 2 3 4 , which is not a pallindrome and Hence, the output is 0.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
| praneethmamidala83 | 583 |
| pallavimanukonda8 | 563 |
| a8haysingh | 451 |
| vraamg | 432 |
| RajatGarg5 | 386 |
| descifrador | 1683 |
| mantu_singh | 1520 |
| rishabh2017 | 1273 |
| gladiator121 | 1268 |
| kid_kb | 1264 |
| blackshadows | 5362 |
| Ibrahim Nash | 5244 |
| akhayrutdinov | 5111 |
| mb1973 | 4974 |
| Quandray | 4732 |