Given a singly linked list, remove all the nodes which have a greater value on right side. Examples: a) The list 12->15->10->11->5->6->2->3->NULL should be changed… Read More »
Given a linked list, write a function to reverse every alternate k nodes (where k is an input to the function) in an efficient way.… Read More »
Difficulty Level: Rookie Write a C function to insert a new value in a sorted Circular Linked List (CLL). For example, if the input CLL… Read More »
Difficulty Level: Rookie Both Arrays and Linked List can be used to store linear data of similar types, but they both have some advantages and… Read More »
Given a linked list, write a function to reverse every k nodes (where k is an input to the function).
Merge sort is often preferred for sorting a linked list. The slow random-access performance of a linked list makes some other algorithms (such as quicksort)… Read More »
Two Linked Lists are identical when they have same data and arrangement of data is also same. For example Linked lists a (1->2->3) and b(1->2->3)… Read More »
Write a SortedMerge() function that takes two lists, each of which is sorted in increasing order, and merges the two together into one list which… Read More »
Write a function AlternatingSplit() that takes one list and divides up its nodes to make two smaller lists ‘a’ and ‘b’. The sublists should be… Read More »
Given a Singly Linked List, starting from the second node delete all alternate nodes of it. For example, if the given linked list is 1->2->3->4->5… Read More »
Given two lists sorted in increasing order, create and return a new list representing the intersection of the two lists. The new list should be… Read More »
Doubly Link List Set 1| Introduction and Insertion Write a function to delete a given node in a doubly linked list.
Given a singly linked list, write a function to swap elements pairwise. For example, if the linked list is 1->2->3->4->5 then the function should change… Read More »
Write a C function that moves last element to front in a given Singly Linked List. For example, if the given Linked List is 1->2->3->4->5,… Read More »
Assume the structure of a Linked List node is as follows.