Java : Delete N Nodes After M Nodes of a Linked List You are given the head of a linked list and two integers m and n. Traverse the linked list and remove some nodes in the following way: - Start with the head as the current node. - Keep the first m nodes starting with the current node. - Remove the next n nodes - Keep repeating steps 2 and 3 until you reach the end of the list. Return the head of the modified list after removing the mentioned  nodes

To calculate the number of nodes in a circularly linked list with a head node that represents a list of positive integers, write a pseudo-code process. The head node stores the number of nodes as a negative number.

Given the following linked lists: Trace the following codeon these two linked lists and show what will be printed.

Draw how an item can be added to the front of a doubly linked list. (show the steps in multiple pictures)

Question : Write a program to remove duplicates from a doubly linked list. e.g (1,2,3,4,5,2) (you will remove the 2nd duplicate) and then swap two data items in a doubly linked list. swap  address of node 2 with node 4.

What is the best way to implement a stack or a queue so that it can hold an arbitrary number of elements? Select one: a. Using an array, and throwing an exception when the stack or queue is full. b. By creating a bigger array when the stack or queue is full, and copying the elements from the original array. c. Using linked lists to store the collection of elements.

A-1: Let l = [−1, −2, . . . , −10] be an existing list. Construct a new list from l by dividing each evennumber element in l by 2. Print the new list. Do not use NUMPY library.A-2: Create a new list containing the following elements using list comprehension:[1, −1, 2, −2, 3, −3, ..., 9, −9]A-3: Consider the following coded string. Create a list of all contiguous (connected without space) lettersin the order of their appearance."Vjg dguv rtqitcou ctg ytkvvgp uq vjcv eqorwvkpi ocejkpgu ecp rgthqto vjgoswkemn{0 Cnuq. vjg dguv rtqitcou ctg ytkvvgp uq vjcv jwocp dgkpiu ecp wpfgtuvcpfvjgo engctn{0 C iqqf guuc{kuv cpf c iqqf rtqitcoogt jcxg c nqv kp eqooqp0"A-4: In the list obtained after executing task(s) from Part(A-3), remove newline characters (if any).A-5: For the list obtained after executing task(s) from Part(A-4), for each word in the list do thefollowing:ˆ Breakdown the word into list of letters.ˆ Convert each of the above letters into integer, using ord() function.ˆ Update the…

JAVA please

Write a program in Java to manipulate a Double Linked List:   Count the number of nodes Insert a new node before the value 7 of Double Linked List Search an existing element in a Double linked list (the element of search is given by the user) Suppose List contained the following Test Data: Input the number of nodes : 4Input data for node 1 : 5Input data for node 2 : 6 Input data for node 3 : 7 Input data for node 4: 9

14) Imagine a circular linked list of integers that are sorted into ascending order, as Figure 5-33a illustrates. The external reference list references the last node, which contains the largest integer. Write a method that revises the list so that its data elements are sorted into descending order, as Figure 5-33b illustrates. Do not allocate new nodes. (a) (b) 2 回 list FIGURE 5-33 4 Two circular linked lists [ 6 子 8 6 00 日 2 8 日照仓 list