Given a singly linked list of size N of integers. The task is to check if the given linked list is palindrome or not.
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(To be used only for expected output):
Input:
2
3
1 2 1
4
1 2 3 4
Output:
1
0
Explanation:
Testcase 1: 1 2 1, linked list is palindrome.
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.
| bruceewayne | 175 |
| manvirag982 | 158 |
| Core_Ka_Bachha | 137 |
| yash_sharan | 136 |
| rajupraaa1234 | 133 |
| mr_kksparrow | 433 |
| manvirag982 | 374 |
| rajupraaa1234 | 268 |
| Exception_404 | 254 |
| PranathiBhuvanagiri | 242 |
| blackshadows | 5331 |
| Ibrahim Nash | 5219 |
| akhayrutdinov | 5111 |
| mb1973 | 4929 |
| Quandray | 4567 |