Medium Accuracy: 49.91%
Submissions: 10693 Points: 4
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.
Reset the IDE using the second button on the top right corner.
Avoid using static/global variables in your code as your code is tested
against multiple test cases and these tend to retain their previous values.
Passing the Sample/Custom Test cases does not guarantee the correctness of code.
On submission, your code is tested against multiple test cases consisting of all
possible corner cases and stress constraints.
You can access the hints to get an idea about what is expected of you as well as
the final solution code.
You can view the solutions submitted by other users from the submission tab.
Here is some troubleshooting advice for contest problems
Make sure you are not using ad-blockers.
Disable browser extensions.
We recommend using latest version of your browser for best experience.
Avoid using static/global variables in coding problems as your code is tested
against multiple test cases and these tend to retain their previous values.
Passing the Sample/Custom Test cases in coding problems does not guarantee the
correctness of code. On submission, your code is tested against multiple test cases
consisting of all possible corner cases and stress constraints.
POTD
POTD
