# Category Archives: Linked List

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 singly linked list, Your task is to remove every K-th node of the linked list. Assume that K is always less than or… Read More
Given a singly linked list, Your task is to remove every K-th node of the linked list. Assume that K is always less than or… Read More
Given a singly linked list, Your task is to remove every K-th node of the linked list. Assume that K is always less than or… Read More
Given a singly linked list, write a function to swap elements pairwise. Input: 1->2->3->4->5->6->NULL  Output: 2->1->4->3->6->5->NULL Input: 1->2->3->4->5->NULL  Output: 2->1->4->3->5->NULL Input: 1->NULL  Output: 1->NULL  For… Read More
Given a singly linked list, write a function to swap elements pairwise. Input: 1->2->3->4->5->6->NULL  Output: 2->1->4->3->6->5->NULL Input: 1->2->3->4->5->NULL  Output: 2->1->4->3->5->NULL Input: 1->NULL  Output: 1->NULL For… Read More
Given a singly linked list, write a function to swap elements pairwise. Input: 1->2->3->4->5->6->NULL  Output: 2->1->4->3->6->5->NULL Input: 1->2->3->4->5->NULL  Output: 2->1->4->3->5->NULL Input: 1->NULL  Output: 1->NULL For… Read More
Given a singly linked list, write a function to swap elements pairwise. Input: 1->2->3->4->5->6->NULL  Output: 2->1->4->3->6->5->NULL Input: 1->2->3->4->5->NULL  Output: 2->1->4->3->5->NULL Input: 1->NULL  Output: 1->NULL  For… Read More
Given a singly linked list, write a function to swap elements pairwise. Input: 1->2->3->4->5->6->NULL  Output: 2->1->4->3->6->5->NULL Input: 1->2->3->4->5->NULL  Output: 2->1->4->3->5->NULL Input: 1->NULL  Output: 1->NULL For… Read More
Given a singly linked list, write a function to swap elements pairwise. Input: 1->2->3->4->5->6->NULL  Output: 2->1->4->3->6->5->NULL Input: 1->2->3->4->5->NULL  Output: 2->1->4->3->5->NULL Input: 1->NULL  Output: 1->NULL For… Read More
QuickSort on Doubly Linked List is discussed here. QuickSort on Singly linked list was given as an exercise. The important things about implementation are, it… Read More
QuickSort on Doubly Linked List is discussed here. QuickSort on Singly linked list was given as an exercise. The important things about implementation are, it… Read More
QuickSort on Doubly Linked List is discussed here. QuickSort on Singly linked list was given as an exercise. The important things about implementation are, it… Read More