Given a linked list, the task is to complete the function **maxPalindrome()** which returns an integer denoting the length of the longest palindrome list that exist in the given linked list.

**Input:**

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains an integer N denoting the size of the linked list . Then in the next line are N space separated values of the given linked list.

**Output:**

For each test case output will be the required max length of the palindrome present in the given linked list.

**User Task**:

The task is to complete the function **maxPalindrome**() which should count the length of longest palindrome in the given list and return it.

**Constraints:**

1 <= T <= 100

1 <= N <= 100

**Example:
Input:**

2

7

2 3 7 3 2 12 24

5

12 4 4 3 14

**Output:**

5

2

**Explanation:
Testcase 1:** 2 -> 3 -> 7 -> 3 -> 2 is the linked list whose nodes leads to a palindrome as 2 3 7 3 2.

Author: Shubham Joshi 1

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.

hari32147 | 206 |

preparecodinginterview_dot_com | 190 |

JonSnow_IKnowNothing | 168 |

shivamsingh00236 | 130 |

AdityaRaj9 | 121 |

abducodes | 906 |

harshtyagi36 | 447 |

arpit_anshuman | 347 |

vaibhavarya16221 | 333 |

vamsikrishna55 | 323 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4567 |

Login to report an issue on this page.