| 1 |
Write a Program to reverse the Linked List. (Both Iterative and recursive) |
| 2 |
Reverse a Linked List in group of Given Size. [Very Imp] |
| 3 |
Write a program to Detect loop in a linked list. |
| 4 |
Write a program to Delete loop in a linked list. |
| 5 |
Find the starting point of the loop. |
| 6 |
Remove Duplicates in a sorted Linked List. |
| 7 |
Remove Duplicates in a Un-sorted Linked List. |
| 8 |
Write a Program to Move the last element to Front in a Linked List. |
| 9 |
Add “1” to a number represented as a Linked List. |
| 10 |
Add two numbers represented by linked lists. |
| 11 |
Intersection of two Sorted Linked List. |
| 12 |
Intersection Point of two Linked Lists. |
| 13 |
Merge Sort For Linked lists.[Very Important] |
| 14 |
Quicksort for Linked Lists.[Very Important] |
| 15 |
Find the middle Element of a linked list. |
| 16 |
Check if a linked list is a circular linked list. |
| 17 |
Split a Circular linked list into two halves. |
| 18 |
Write a Program to check whether the Singly Linked list is a palindrome or not. |
| 19 |
Deletion from a Circular Linked List. |
| 20 |
Reverse a Doubly Linked list. |
| 21 |
Find pairs with a given sum in a DLL. |
| 22 |
Count triplets in a sorted DLL whose sum is equal to given value “X”. |
| 23 |
Sort a “k”sorted Doubly Linked list.[Very IMP] |
| 24 |
Rotate DoublyLinked list by N nodes. |
| 25 |
Rotate a Doubly Linked list in group of Given Size.[Very IMP] |
| 26 |
Can we reverse a linked list in less than O(n) ? |
| 27 |
Why Quicksort is preferred for. Arrays and Merge Sort for LinkedLists ? |
| 28 |
Flatten a Linked List |
| 29 |
Sort a LL of 0's, 1's and 2's |
| 30 |
Clone a linked list with next and random pointer |
| 31 |
Merge K sorted Linked list |
| 32 |
Multiply 2 no. represented by LL |
| 33 |
Delete nodes which have a greater value on right side |
| 34 |
Segregate even and odd nodes in a Linked List |
| 35 |
Program for n’th node from the end of a Linked List |
| 36 |
Find the first non-repeating character from a stream of characters |