Practice Questions :

• Remove Duplicates from a Unsorted Linked List ?
• Sort an SLL using Quicksort .
• Given an SLL ,Swap every Kth node from the start and Kth node from the end .First node should be swapped with last node ,Second node with last but one node and so on .Note :Only pointers should be swapped ,Not data .
• Detect a Cycle in a Singly Linked List ?
• Given two Linked Lists which represent a number ,like 1->2->3->4 and 5->2->2 .Return a new SLL which is the sumList of the above two lists .Here sum list is 1->7->5->6
• Reverse Every K nodes in an SLL .
• Reverse a Doubly Linked List
• Code an SLL in such a way that its data is persistent ,using Files
• Convert a SLL into a DLL ? (Assume all nodes of SLL has prev pointer fields NULL )