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

Given a singly linked list, remove all the nodes which have a greater value on the right side. Examples: a) The list 12->15->10->11->5->6->2->3->NULL should be… Read More »

- Implement a stack using singly linked list
- Delete a Node from linked list without head pointer
- Print the last k nodes of the linked list in reverse order
- Remove last node of the linked list
- Coviam Software Developer Internship Experience
- Clone a stack without extra space
- Remove first node of the linked list
- Difference between Singly linked list and Doubly linked list
- Flatten a binary tree into linked list | Set-3
- Multiplication of two polynomials using Linked list
- Program to reverse a linked list using Stack
- Delete all the even nodes of a Circular Linked List
- Pairwise swap adjacent nodes of a linked list by changing pointers | Set 2
- Append odd position nodes in reverse at the end of even positioned nodes in a Linked List
- Min and Max in a List in Java
- Second Smallest Element in a Linked List
- Rotate the sub-list of a linked list from position M to N to the right by K places
- Find the second last node of a linked list in single traversal
- Convert Singly Linked List to XOR Linked List
- Finding Median in a Sorted Linked List
- Delete all odd or even positioned nodes from Circular Linked List
- Deletion at different positions in a Circular Linked List
- Sum and Product of the nodes of a Circular Singly Linked List which are divisible by K
- Find minimum and maximum elements in singly Circular Linked List
- Delete all Prime Nodes from a Circular Singly Linked List
- Check if a pair with given product exists in Linked list
- Print nodes of linked list at given indexes
- Sum of the alternate nodes of linked list
- Count of Prime Nodes of a Singly Linked List
- Find the common nodes in two singly linked list

Given a singly linked list, remove all the nodes which have a greater value on the right side. Examples: a) The list 12->15->10->11->5->6->2->3->NULL should be… Read More »

Given a Linked List as the input. The task is to encode the given linked list using Run Length Encoding. That is, to replace a… Read More »

Given a linked list. The task is to reverse the order of the elements of the Linked List using an auxiliary Stack. Examples: Input :… Read More »

Given a singly linked list, write a function to swap elements pairwise. Input : 1->2->3->4->5->6->7 Output : 2->1->4->3->6->5->7, Input : 1->2->3->4->5->6 Output : 2->1->4->3->6->5 Recommended:… Read More »

Given a pointer to the head of a singly linked list and an integer k. The task is to find the product of first k… Read More »

Given a linked list containing N nodes and a positive integer k should be less than or equal to N. The task is to print… Read More »

Prerequisite: XOR Linked List – A Memory Efficient Doubly Linked List | Set 1 XOR Linked List – A Memory Efficient Doubly Linked List |… Read More »

Applied through employee referral Round 1: I was sent a link 40 multiple choice questions were there 20 aptitude questions and rest 20 questions from java fundamentals,… Read More »

Given a Singly Linked List. The task is to check if the absolute difference between the consecutive nodes in the linked list is 1 or… Read More »

Given LinkedList, replace each node’s value with its surpasser count. That is the count of elements which are greater towards its right. Examples: Input :… Read More »

Given A sorted linked list of elements. The task is to find the median in the given Sorted Linked List. We know that median in… Read More »

Given a singly linked list containing n nodes. Modify the value of first half nodes such that 1st node’s new value is equal to the… Read More »

Introduction to Singly linked list : A singly linked list is a set of nodes where each node has two fields ‘data’ and ‘link’. The… Read More »

Given a doubly linked list ‘L’ and an array ‘refArr’ of references to the nodes of the doubly linked list ‘L’. Array 'refArr' does not… Read More »

Given a linked list. The task is to segregate its even and odd position nodes in such a way that odd position nodes appear before… Read More »