Given a singly linked list, write a function to swap elements pairwise. For example, if the linked list is 1->2->3->4->5->6->7
Given two linked lists, insert nodes of second list into first list at alternate positions of first list.
QuickSort on Doubly Linked List is discussed here. QuickSort on Singly linked list was given as an exercise. Following is C++ implementation for same.
Given a linked list and two integers M and N. Traverse the linked list such that you retain M nodes then delete next N nodes,… Read More »
Given a singly linked list, swap kth node from beginning with kth node from end. Swapping of data is not allowed, only pointers should be… Read More »
Following is a typical recursive implementation of QuickSort for arrays. The implementation uses last element as pivot.
We have introduced Linked Lists in the previous post. We also created a simple linked list with 3 nodes and discussed linked list traversal.
Like arrays, Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at contiguous location; the elements are linked using… Read More »
Given a linked list where in addition to the next pointer, each node has a child pointer, which may or may not point to a… Read More »
Given a linked list of 0s, 1s and 2s, sort it. Source: Microsoft Interview | Set 1
Given two numbers represented by two linked lists, write a function that returns sum list. The sum list is linked list representation of addition of… Read More »
Given a linked list where every node represents a linked list and contains two pointers of its type:
Given a singly linked list, rotate the linked list counter-clockwise by k nodes. Where k is a given positive integer.
Given three linked lists, say a, b and c, find one node from each list such that the sum of the values of the nodes… Read More »
In the previous post, we discussed how a Doubly Linked can be created using only one space for address field with every node.