1. You are given a linked list with N nodes.
2. You have to write a function that returns returns an integer denoting
the length of the longest palindrome list that exist in the given linked list.
3. For Example:
Input : List = 2->3->7->3->2->12->24
Output : 5
The longest palindrome list is 2->3->7->3->2
4. display is a utility function which displays the contents of Linked List,
feel free to use it for debugging purposes.
5. main takes input from the users and creates the Linked List. You can use
display to know its contents.
6. This is a functional problem.
7. You should code only the maxPalindrome function. It takes as input the
heads of the linked list. It should return the length of the longest
palindrome in the linked list.
8. Don't change the code of Node, main and display.Input Format
First line takes N, the number of elements in the list. Second line takes input N space separated numbers reperesenting elements of the linked list. Input is handled for you.
Output Format
Maximum length of palindrome Output is handled for you.
Constraints
1 <= N <= 1000
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
7 2 3 7 3 2 12 24
Output
5