| 622 | Design Circular Queue | Medium |
| 641 | Design Circular Deque | Medium |
| 705 | Design HashSet | Easy |
| 706 | Design HashMap | Easy |
| 707 | Design Linked List | Medium |
| 725 | Split Linked List in Parts | Medium |
| 817 | Linked List Components | Medium |
| 1019 | Next Greater Node In Linked List | Medium |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | Medium |
| 1206 | Design Skiplist | Hard |
| 1290 | Convert Binary Number in a Linked List to Integer | Easy |
| 1367 | Linked List in Binary Tree | Medium |
| 1472 | Design Browser History | Medium |
| 1669 | Merge In Between Linked Lists | Medium |
| 1670 | Design Front Middle Back Queue | Medium |
| 1721 | Swapping Nodes in a Linked List | Medium |
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium |
| 2074 | Reverse Nodes in Even Length Groups | Medium |
| 2095 | Delete the Middle Node of a Linked List | Medium |
| 2130 | Maximum Twin Sum of a Linked List | Medium |
| 2181 | Merge Nodes in Between Zeros | Medium |
| 2289 | Steps to Make Array Non-decreasing | Medium |
| 2296 | Design a Text Editor | Hard |
| 2326 | Spiral Matrix IV | Medium |
| 2487 | Remove Nodes From Linked List | Medium |
| 2807 | Insert Greatest Common Divisors in Linked List | Medium |
| 2816 | Double a Number Represented as a Linked List | Medium |