Skip to content

Category Archives: Linked List

Given k linked lists each of size n and each list is sorted in non-decreasing order, merge them into a single sorted (non-decreasing order) linked… Read More
Given k linked lists each of size n and each list is sorted in non-decreasing order, merge them into a single sorted (non-decreasing order) linked… Read More
Given a linked list and a key in it, the task is to move all occurrences of the given key to the end of the… Read More
Given a linked list and a key in it, the task is to move all occurrences of the given key to the end of the… Read More
Given a singly linked list as list, a position, and a node, the task is to insert that element in the given linked list at… Read More
Given a sorted singly linked list as list of N distinct nodes (no two nodes have the same data) and an integer S. The task… Read More
Given a linked list A[] of N integers, the task is to reverse the order of all integers at an even position. Examples: Input: A[]… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More

Start Your Coding Journey Now!