#linked_list

Input: List = 2 ->4 ->7 ->4 ->2 ->12 ->0

Output: 5

The longest palindrome list is 2 ->4 ->7 ->4 ->2

Input:List = 12 ->5 ->5 ->3 ->11

Output:2

The longest palindrome list is 5 -> 5

Method:

There is a simple solution available for this problem, we can copy the linked list to the array and try to find the longest palindromic subarray in the array, but this solution is not allowed here because this solution requires extra space. So we will see another method for the given problem.

Example:  The given linked list is 2 -> 4 -> 6 -> 8 ->10 then the output will be 2 -> 4 -> 8 -> 10.

If the given linked list has an even number of nodes, then there are two middle nodes, and we are required to delete the second middle element of the linked list.

Example:  The given linked list is 2 -> 4 -> 6 -> 8 ->10 -> 12 then the output will be

In this article, we are going to learn how to merge two linked lists. Here we have given two linked lists that are sorted in increasing order, and we need to merge them into one list, which will also be in increasing order.

Example:

This article explains how to get the middle element of a linked list. Here, we are going to take a singly linked list and find the middle element of the given linked list.

Example: The given linked list is 2 -> 4 -> 6 -> 8 ->10 then the output will be 6.

If the given linked list has an even number of nodes, then there are two middle nodes, and we are required to print the second middle element of the linked list.

We can clone a linked list with random numbers by maintaining a hash table. The hash table stores the mapping from a linked list node to its clone.

Algorithm: –

Firstly, we will create the copy of node1 and then add or insert it between node1 and node2 in the ori Linked List. After that, we will create a copy of node2 and add it between node2 and node3 in ori and so on, add the copy of N after the nth node.

Next, we will copy the given arb(arbitrary) link in the below fashion.

ori->next->arb = ori->arb->next;

Now, we restore the ori linked list and copy linked list in the below fashion in a single loop.

ori->next = ori->next->next;

  copy->next = copy->next->next;

Là cấu trúc dữ liệu gồm dãy các node kết nối với nhau thông qua các link (liên kết).