SET 1
- Nth node from the end of a Linked List
- Reverse a linked list
- Detect and Remove Loop in a Linked List
- Intersection point of two Linked Lists.
- Clone a linked list with next and random pointer in O(1) space
SET 2
- Print the middle of a given linked list
- Merge Sort for Linked Lists
- Reverse alternate K nodes in a Singly Linked List
- Reverse a Linked List in groups of given size
- Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
Comments
Post a Comment