Filter by difficulty:
All
Easy
Medium
Hard
•
Remove duplicates from a sorted linked list
Easy
•
Remove nodes with a given value
Easy
•
Remove Nth node from the end
Medium
•
Detect a loop in a linked list
Easy
•
Find the starting point of the loop
Medium
•
Check if two linked lists merge and find merge point
Easy
•
Merge two sorted linked lists
Easy
•
Merge K sorted linked lists
Hard
•
Flatten a 2D singly linked list
Medium
•
Flatten a multilevel doubly linked list
Medium
•
Reverse a complete linked list
Easy
•
Reverse linked list in blocks of size K
Medium
•
Swap nodes in pairs
Medium
•
Reverse alternate blocks of size K
Medium
•
Reverse the linked list between two indices
Medium
•
Partition the linked list around value X
Medium
•
Reorder list L0 → Ln → L1 → Ln-1
Medium
•
Rotate the linked list by K nodes
Medium
•
Insertion sort on a linked list
Medium
•
Merge sort on a linked list
Medium
•
Add two numbers represented as linked lists
Medium
•
Copy the linked list with a random pointer
Medium
•
Check if the linked list is a palindrome
Easy
•
Design LRU Cache
Medium
•
Convert a binary linked list to decimal
Easy