| Merge Two Sorted Lists | Easy | 68.0% |
| Add Two Numbers | Medium | 48.0% |
| Middle of the Linked List | Easy | 81.6% |
| Remove Nth Node From End of List | Medium | 51.0% |
| Reverse Linked List | Easy | 80.3% |
| Linked List Cycle | Easy | 53.9% |
| LRU Cache | Medium | 46.8% |
| Reverse Nodes in k-Group | Hard | 65.4% |
| Delete Node in a Linked List | Medium | 83.6% |
| Design Twitter | Medium | 44.2% |
| Intersection of Two Linked Lists | Easy | 63.2% |
| All O`one Data Structure | Hard | 44.2% |
| Merge k Sorted Lists | Hard | 58.9% |
| Swap Nodes in Pairs | Medium | 69.0% |
| Copy List with Random Pointer | Medium | 62.4% |
| Reverse Linked List II | Medium | 51.0% |
| Convert Sorted List to Binary Search Tree | Medium | 66.0% |
| Design HashMap | Easy | 66.4% |
| Palindrome Linked List | Easy | 57.5% |
| Linked List Cycle II | Medium | 57.3% |
| Odd Even Linked List | Medium | 62.3% |
| Rotate List | Medium | 41.2% |
| Reorder List | Medium | 64.6% |
| LFU Cache | Hard | 48.6% |
| Sort List | Medium | 63.9% |
| Remove Duplicates from Sorted List | Easy | 56.3% |
| Partition List | Medium | 60.6% |
| Design Circular Queue | Medium | 54.0% |
| Remove Linked List Elements | Easy | 53.9% |
| Flatten a Multilevel Doubly Linked List | Medium | 62.6% |
| Flatten Binary Tree to Linked List | Medium | 70.2% |
| Design Browser History | Medium | 78.2% |
| Minimum Pair Removal to Sort Array II | Hard | 39.2% |
| Design Linked List | Medium | 29.9% |
| Swapping Nodes in a Linked List | Medium | 69.2% |
| Linked List Components | Medium | 57.8% |
| Populating Next Right Pointers in Each Node | Medium | 66.9% |
| Delete the Middle Node of a Linked List | Medium | 59.5% |
| Maximum Twin Sum of a Linked List | Medium | 81.6% |
| Remove Nodes From Linked List | Medium | 74.8% |
| Max Stack | Hard | 45.9% |
| Delete Nodes From Linked List Present in Array | Medium | 69.5% |
| Split Linked List in Parts | Medium | 70.5% |
| Populating Next Right Pointers in Each Node II | Medium | 57.1% |
| Add Two Numbers II | Medium | 62.4% |
| Remove Duplicates from Sorted List II | Medium | 51.3% |
| Next Greater Node In Linked List | Medium | 63.9% |
| Insertion Sort List | Medium | 58.5% |
| Convert Binary Number in a Linked List to Integer | Easy | 82.3% |
| Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | 69.5% |
| Merge Nodes in Between Zeros | Medium | 89.7% |
| Design a Text Editor | Hard | 50.1% |
| Minimum Pair Removal to Sort Array I | Easy | 65.3% |
| Design HashSet | Easy | 67.8% |
| Remove Zero Sum Consecutive Nodes from Linked List | Medium | 53.1% |
| Double a Number Represented as a Linked List | Medium | 61.3% |
| Plus One Linked List | Medium | 61.2% |
| Merge In Between Linked Lists | Medium | 82.9% |
| Linked List in Binary Tree | Medium | 51.9% |
| Design Front Middle Back Queue | Medium | 56.9% |
| Add Two Polynomials Represented as Linked Lists | Medium | 61.0% |
| Reverse Nodes in Even Length Groups | Medium | 63.7% |
| Design Circular Deque | Medium | 64.4% |
| Convert Binary Search Tree to Sorted Doubly Linked List | Medium | 65.6% |
| Remove Duplicates From an Unsorted Linked List | Medium | 75.7% |
| Design Skiplist | Hard | 59.5% |
| Insert into a Sorted Circular Linked List | Medium | 38.5% |
| Design Authentication Manager | Medium | 58.4% |
| Insert Greatest Common Divisors in Linked List | Medium | 91.4% |
| Spiral Matrix IV | Medium | 82.3% |
| Linked List Random Node | Medium | 64.7% |
| Design Most Recently Used Queue | Medium | 77.8% |
| Design Phone Directory | Medium | 52.7% |