Category: Linked List

Given a Linked List and a number n, write a program that finds the node at the nth node from end of the Linked List. Solution : Take

1. Reverse List in place, Time : O(n) and Space : O(1). 2. Reverse List in Pairs in place, Time : O(n) and Space : O(1). 3. Reverse

Detect and Remove Loop in a Linked List. Solution : 1 : Using map maintain key value pair of node and its next pointer , while traversing before

Clone a linked list with next and random pointer. Solution 1 : By using Map, In first traversing of list clone the entire list into map. And now