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.

Examples:

```
Input : List = 2->3->7->3->2->12->24
Output : 5
The longest palindrome list is 2->3->7->3->2
Input : List = 12->4->4->3->14
Output : 2
The longest palindrome list is 4->4
```

**Input:**

The first line of input contains an integer T denotingo the no 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.

**Constraints:**

1<=T<=100

1<=N<=100

**Example(To be used only for expected output):
Input:**

2

7

2 3 7 3 2 12 24

5

12 4 4 3 14

5

2

Author: Shubham Joshi 1

may55 | 86 |

ashujack | 84 |

aman19 | 82 |

abbatta7 | 75 |

lakshmi_pandey | 74 |

saumitra13325 | 648 |

ashujack | 591 |

aman19 | 562 |

lakshmi_pandey | 546 |

aroma17 | 535 |

blackshadows | 5249 |

akhayrutdinov | 5111 |

Ibrahim Nash | 5087 |

Quandray | 4354 |

sanjay05 | 3668 |

Login to report an issue on this page.