- Binary Search Tree To Doubly Linked List
- Kth node from last of linked list
- Find intersection Point in Y Shaped Linked Lists
- Split a Circular Linked List
- Merge two sorted linked lists
- Intersection of two sorted Linked lists
- Merge two sorted linked lists such that merged list is in reverse order
- Write a function to reverse a linked list
- Reorder List
- QuickSort on Doubly Linked List
- Linked List in Zig-Zag fashion
- Implement Stack using Linked List
- Given a singly linked list, remove all the nodes which have a greater value on right side.
- Given a linked list, reverse alternate nodes and append at the end
- Implement Queue using Linked List
- Pairwise swap elements of a linked list by swapping data
- List multiplication
- Delete Middle of Linked List
- Remove loop from list
- Segregate even and odd nodes in a Linked List
- Remove duplicate element from sorted Linked List
- Delete without head pointer
- Clone a linked list with next and random pointer
- Flattening a Linked List
- Reverse a Linked List in groups of given size
- Sorted insert for circular linked list
- Merge two sorted linked lists
- Binary Tree (BT) to Double Linked List (DLL)
- Add two numbers represented by linked lists
- Absolute List Sorting
- Split a circular linked List into two equal parts
- For a given K value (K>0) reverse blocks of K nodes in a list
- Reverse a singly linked list
- How to find the starting point of a loop in a linked list.
- Find nth node from last in singly linked list in one scan
- SkipList java implementation