- Reverse a linked listEasy✓ Solved2 approaches
- Detect Loop in linked listEasy✓ Solved2 approaches
- Merge 2 sorted Linked ListsEasy✓ Solved2 approaches
- Remove Nth node from end of Linked ListMedium✓ Solved1 approach
- Reverse a linked list in groups of size kMedium✓ Solved1 approach
- Delete the loop in a linked listMedium✓ Solved1 approach
- Remove duplicates from a sorted linked listEasy✓ Solved1 approach
- Remove duplicates from an unsorted linked listEasy✓ Solved1 approach
- Move the last element to the frontEasy✓ Solved1 approach
- Add 1 to a number represented as a linked listMedium✓ Solved1 approach
- Add two numbers represented by linked listsMedium✓ Solved1 approach
- Intersection of two sorted linked lists (by value)Easy✓ Solved1 approach
- Intersection point of two linked lists (shared node)Easy✓ Solved2 approaches
- Merge sort for linked listsMedium✓ Solved1 approach
- Quicksort for linked listsMedium✓ Solved1 approach
- Find the middle element of a linked listEasy✓ Solved1 approach
- Check if a linked list is circularEasy✓ Solved1 approach
- Split a circular linked list into two halvesMedium✓ Solved1 approach
- Check whether a singly linked list is a palindromeEasy✓ Solved1 approach
- Reverse a doubly linked listEasy✓ Solved1 approach
- Find pairs with a given sum in a sorted doubly linked listEasy✓ Solved1 approach
- Count triplets in a sorted DLL with a given sumMedium✓ Solved1 approach
- Sort a k-sorted doubly linked listMedium✓ Solved1 approach
- Rotate a doubly linked list by N nodesEasy✓ Solved1 approach
- Delete nodes that have a greater value on the right sideMedium✓ Solved1 approach
- Segregate even and odd nodes in a linked listEasy✓ Solved1 approach
- Sort a linked list of 0s, 1s and 2sEasy✓ Solved1 approach
- Flatten a linked list (each node has a bottom sub-list)Medium✓ Solved1 approach
- Clone a linked list with next and random pointersMedium✓ Solved1 approach
- Merge K sorted linked listsHard✓ Solved1 approach
- Multiply two numbers represented by linked listsEasy✓ Solved1 approach
- Program for n'th node from the end of a linked listEasy✓ Solved1 approach
- First non-repeating character in a streamMedium✓ Solved1 approach
- Can we reverse a linked list in less than O(n)? / Why quicksort for arrays, merge sort for lists?Easy✓ Solved1 approach
- Deletion from a circular linked listEasy✓ Solved1 approach
- Reorder ListMedium✓ Solved1 approach