Given a linked list consisting of N nodes and an integer K, the task is to split the given Linked List into K continuous groups… Read More

# Category Archives: Linked List

Given a sparse matrix mat[][] of dimensions N*M, the task is to construct and represent the original matrix using a Linked List and reconstruct the… Read More

Linked List is Linear Data Structures that store values in nodes. As we do know here each Nod possesses two properties namely the value of… Read More

Given a singly Linked List L consisting of N nodes and an integer K, the task is to modify the value of each node of… Read More

Given a circular doubly linked list consisting of N nodes, the task is to modify every node of the given Linked List such that each… Read More

Given two linked lists of size N and M consisting of positive value nodes, having a common intersection point, the task is to find the… Read More

Unlike arrays, linked list elements are not stored at a contiguous location; the elements are linked using pointers. In this post, methods to insert a… Read More

Design a data structure that supports the following operations in queue efficiently: push__front(x): Insert an element at the front of the queue. push__middle(x): Inserts element… Read More

Given a Linked List and two integers X and Y, the task is to remove all occurrences of Y after the first occurrence of a… Read More

Given a XOR Linked List and a positive integer K, the task is to reverse the last K nodes in the given XOR linked list.… Read More

Given an array arr[] consisting of N integers representing N transactions, the task is to merge the given lists of transactions in the order of… Read More

Given a singly Linked List, the task is to swap the first odd valued node from the beginning and the first even valued node from… Read More

Given a singly Linked List and an integer K denoting the position of a Linked List, the task is to delete the Kth node from… Read More

Given an XOR linked list, the task is to delete the node at the end of the XOR Linked List. Examples: Input: 4<–>7<–>9<–>7Output: 4<–>7<–>9Explanation: Deleting… Read More

In a Circular linked list, every element has a link to its next element in the sequence and the last element has a link to… Read More