## Program to unfold a folded linked list

A linked list L0 -> L1 -> L2 -> ….. -> LN can be folded as L0 -> LN -> L1 -> LN – 1… Read More »

- Introduction to Data Structures | 10 most commonly used Data Structures
- Add Two Numbers Represented by Linked Lists | Set 3
- Delete Nth node from the end of the given linked list
- Add the given digit to a number stored in a linked list
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Create new linked list from two given linked list with greater element at each node
- Reverse a Linked List in groups of given size (Iterative Approach)
- Count duplicates in a given linked list
- Maximum sum of K consecutive nodes in the given Linked List
- Reverse alternate K nodes in a Singly Linked List - Iterative Solution
- Remove Nth node from end of the Linked List
- Add one to a number represented as linked list | Set 2
- Find the balanced node in a Linked List
- Write a function to get the intersection point of two Linked Lists | Set 2
- Reverse even elements in a Linked List
- Create a linked list from two linked lists by choosing max element at each position
- Find the first duplicate element in the linked list
- Divide the given linked list in two lists of size ratio p:q
- Merge K sorted Doubly Linked List in Sorted Order
- Maximum sum contiguous nodes in the given linked list
- Python | Stack using Doubly Linked List
- Traverse Linked List from middle to left-right order using recursion
- Run Length Decoding in Linked List
- Bitonic point in the given linked list
- Splitting starting N nodes into new Circular Linked List while preserving the old nodes
- Adding two polynomials using Linked List using map
- Insertion in a sorted circular linked list when a random pointer is given
- Subtraction of the alternate nodes of Linked List
- Add the given digit to a number stored in a linked list using recursion
- Python | Queue using Doubly Linked List

A linked list L0 -> L1 -> L2 -> ….. -> LN can be folded as L0 -> LN -> L1 -> LN – 1… Read More »

Given a doubly linked list having exactly one of the node pointing to a random node in the list, the task is to correct this… Read More »

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

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 »