Skip to content

Topic: Linked List

66 problems
TitleStatusDifficulty
Add Two Numbers—Medium
Remove Nth Node From End of List—Medium
Merge Two Sorted Lists—Easy
Merge k Sorted Lists—Hard
Swap Nodes in Pairs—Medium
Reverse Nodes in k-Group—Hard
Rotate List—Medium
Remove Duplicates from Sorted List II—Medium
Remove Duplicates from Sorted List—Easy
Partition List—Medium
Reverse Linked List II—Medium
Convert Sorted List to Binary Search Tree—Medium
Flatten Binary Tree to Linked List—Medium
Populating Next Right Pointers in Each Node—Medium
Populating Next Right Pointers in Each Node II—Medium
Copy List with Random Pointer—Medium
Linked List Cycle—Easy
Linked List Cycle II—Medium
Reorder List—Medium
LRU Cache—Medium
Insertion Sort List—Medium
Sort List—Medium
Intersection of Two Linked Lists—Easy
Remove Linked List Elements—Easy
Reverse Linked List—Easy
Palindrome Linked List—Easy
Delete Node in a Linked List—Medium
Odd Even Linked List—Medium
Design Twitter—Medium
Linked List Random Noderead—Medium
Flatten a Multilevel Doubly Linked List—Medium
All O`one Data Structureread—Hard
Add Two Numbers II—Medium
LFU Cache—Hard
Design Circular Queue—Medium
Design Circular Deque—Medium
Design HashSet—Easy
Design HashMap—Easy
Design Linked List—Medium
Split Linked List in Parts—Medium
Linked List Components—Medium
Middle of the Linked List—Easy
Next Greater Node In Linked List—Medium
Remove Zero Sum Consecutive Nodes from Linked List—Medium
Design Skiplist—Hard
Convert Binary Number in a Linked List to Integer—Easy
Linked List in Binary Tree—Medium
Design Browser History—Medium
Merge In Between Linked Lists—Medium
Design Front Middle Back Queue—Medium
Page 1 of 2