ll :: archgaelix

Merge Two Sorted Lists
#ll #easy
Linked List Cycle
#ll #twopointers #easy
Reverse Linked List
#ll #easy
Middle of the Linked List
#ll #twopointers #easy
LRU Cache
#ll #hashtable #medium
Reverse a linked list
#ll
Reverse a linked list in group of given size
#ll
Detect loop in a linked list
#ll
Delete loop in a linked list
#ll
Find the starting point of the loop
#ll
Remove duplicates in a sorted linked list
#ll
Remove duplicates in a unsorted linked list
#ll
Move the last element to front in a linked list
#ll
Add 1 to a number represented as a linked list
#ll
Add two numbers represented by linked lists
#ll
Intersection of two sorted linked list
#ll
Intersection point of two linked lists
#ll
Merge sort for linked lists
#ll
Quicksort for linked lists
#ll
Find the middle element of a linked list
#ll
Check if a linked list is a circular linked list
#ll
Split a circular linked list into two halves
#ll
Check whether the singly linked list is a palindrome
#ll
Deletion from a circular linked list
#ll
Reverse a doubly linked list
#ll
Find pairs with a given sum in a DLL
#ll
Count triplets in a sorted DLL whose sum is equal to given value X
#ll
Sort a K sorted doubly linked list
#ll
Rotate DLL by N nodes
#ll
Rotate a doubly linked list in group of given size
#ll
Can we reverse a linked list in less than O(n)?
#ll
Why is quicksort preferred for arrays while merge sort for linked lists?
#ll
Flatten a linked list
#ll
Sort a ll of 0s, 1s and 2s
#ll
Clone a linked list with next and random pointer
#ll
Multiply 2 numbers represented by ll
#ll
Delete nodes which have a greater value on right side
#ll
Segregate even and odd nodes in a linked list
#ll
Program for Nth node from the end of a linked list
#ll
Find the first non-repeating character from a stream of characters
#ll
Merge K sorted linked lists
#ll #heap