## Delete nodes which have a greater value on right side

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 »

- Create linked list from a given array
- Add Two Numbers Represented by Linked Lists | Set 3
- Introduction to Data Structures | 10 most commonly used Data Structures
- Add the given digit to a number stored in a linked list
- Print the last k nodes of the linked list in reverse order | Iterative Approaches
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Bubble Sort for Linked List by Swapping nodes
- Create new linked list from two given linked list with greater element at each node
- Linked List Implementation in C#
- Delete Nth node from the end of the given linked list
- Reverse a Linked List in groups of given size (Iterative Approach)
- Count duplicates in a given linked list
- Find sum of even and odd nodes in a linked list
- Iterative selection sort for linked list
- Maximum sum of K consecutive nodes in the given Linked List
- Program to unfold a folded linked list
- Reverse alternate K nodes in a Singly Linked List - Iterative Solution
- Correct the Random Pointer in Doubly Linked List
- Sum of all distinct nodes in a linked list
- Sum of nodes in a linked list which are greater than next node
- Find the balanced node in a Linked List
- Add one to a number represented as linked list | Set 2
- Insert N elements in a Linked List one after other at middle position
- Divide the given linked list in two lists of size ratio p:q
- Create a linked list from two linked lists by choosing max element at each position
- Remove Nth node from end of the Linked List
- Sum of smaller elements of nodes in a linked list
- Maximum sum contiguous nodes in the given linked list
- Check whether the sum of element of a node is equal to the given key value
- Sum of all odd frequency nodes of the Linked List

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 »

Both Arrays and Linked List can be used to store linear data of similar types, but they both have some advantages and disadvantages over each… Read More »

Given a linked list, write a function to reverse every k nodes (where k is an input to the function). Example: Input: 1->2->3->4->5->6->7->8->NULL, K =… Read More »

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. (a) Original Doubly Linked… Read More »

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 function that moves the last element to the front in a given Singly Linked List. For example, if the given Linked List is… Read More »

Assume the structure of a Linked List node is as follows. filter_none edit close play_arrow link brightness_4 code struct Node { int data; struct Node… Read More »