Linked List LeetCode Problems: All 75, With Python Solutions
Every problem in this library that LeetCode tags Linked List — 75 in total, 63 of them with a complete Python solution, a worked example and the time and space complexity of the approach.
- 75 problems
- 12 Easy
- 56 Medium
- 7 Hard
How Linked List problems are solved
A tag names the subject, not the method. These pattern hubs cover the techniques that actually solve Linked List problems — each one explains the approach, gives a Python template and states its complexity.
- Linked List — Rewire pointers in place, with a dummy head and a saved next to keep it safe.
Linked List problems by difficulty
Problems with a complete Python solution are listed first, then by ascending problem number.
Easy (12)
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 21 | Merge Two Sorted Lists | Easy | Recursion, Linked List |
| 83 | Remove Duplicates from Sorted List | Easy | Linked List |
| 141 | Linked List Cycle | Easy | Hash Table, Linked List, Two Pointers |
| 160 | Intersection of Two Linked Lists | Easy | Hash Table, Linked List, Two Pointers |
| 203 | Remove Linked List Elements | Easy | Recursion, Linked List |
| 206 | Reverse Linked List | Easy | Recursion, Linked List |
| 234 | Palindrome Linked List | Easy | Stack, Recursion, Linked List +1 |
| 705 | Design HashSet | Easy | Design, Array, Hash Table +2 |
| 706 | Design HashMap | Easy | Design, Array, Hash Table +2 |
| 876 | Middle of the Linked List | Easy | Linked List, Two Pointers |
| 1290 | Convert Binary Number in a Linked List to Integer | Easy | Linked List, Math |
| 1474 | Delete N Nodes After M Nodes of a Linked ListPremium | Easy | Linked List |
Medium (56)
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 2 | Add Two Numbers | Medium | Recursion, Linked List, Math |
| 19 | Remove Nth Node From End of List | Medium | Linked List, Two Pointers |
| 24 | Swap Nodes in Pairs | Medium | Recursion, Linked List |
| 61 | Rotate List | Medium | Linked List, Two Pointers |
| 82 | Remove Duplicates from Sorted List II | Medium | Linked List, Two Pointers |
| 86 | Partition List | Medium | Linked List, Two Pointers |
| 92 | Reverse Linked List II | Medium | Linked List |
| 109 | Convert Sorted List to Binary Search Tree | Medium | Tree, Binary Search Tree, Linked List +2 |
| 114 | Flatten Binary Tree to Linked List | Medium | Stack, Tree, Depth-First Search +2 |
| 116 | Populating Next Right Pointers in Each Node | Medium | Tree, Depth-First Search, Breadth-First Search +2 |
| 117 | Populating Next Right Pointers in Each Node II | Medium | Tree, Depth-First Search, Breadth-First Search +2 |
| 138 | Copy List with Random Pointer | Medium | Hash Table, Linked List |
| 142 | Linked List Cycle II | Medium | Hash Table, Linked List, Two Pointers |
| 143 | Reorder List | Medium | Stack, Recursion, Linked List +1 |
| 146 | LRU Cache | Medium | Design, Hash Table, Linked List +1 |
| 147 | Insertion Sort List | Medium | Linked List, Sorting |
| 148 | Sort List | Medium | Linked List, Two Pointers, Divide and Conquer +2 |
| 237 | Delete Node in a Linked List | Medium | Linked List |
| 328 | Odd Even Linked List | Medium | Linked List |
| 355 | Design Twitter | Medium | Design, Hash Table, Linked List +1 |
| 382 | Linked List Random Node | Medium | Reservoir Sampling, Linked List, Math +1 |
| 430 | Flatten a Multilevel Doubly Linked List | Medium | Depth-First Search, Linked List, Doubly-Linked List |
| 445 | Add Two Numbers II | Medium | Stack, Linked List, Math |
| 622 | Design Circular Queue | Medium | Design, Queue, Array +1 |
| 641 | Design Circular Deque | Medium | Design, Queue, Array +1 |
| 707 | Design Linked List | Medium | Design, Linked List |
| 725 | Split Linked List in Parts | Medium | Linked List |
| 817 | Linked List Components | Medium | Array, Hash Table, Linked List |
| 1019 | Next Greater Node In Linked List | Medium | Stack, Array, Linked List +1 |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | Medium | Hash Table, Linked List |
| 1367 | Linked List in Binary Tree | Medium | Tree, Depth-First Search, Linked List +1 |
| 1472 | Design Browser History | Medium | Stack, Design, Array +3 |
| 1669 | Merge In Between Linked Lists | Medium | Linked List |
| 1670 | Design Front Middle Back Queue | Medium | Design, Queue, Array +2 |
| 1721 | Swapping Nodes in a Linked List | Medium | Linked List, Two Pointers |
| 1797 | Design Authentication Manager | Medium | Design, Hash Table, Linked List +1 |
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | Linked List |
| 2074 | Reverse Nodes in Even Length Groups | Medium | Linked List |
| 2095 | Delete the Middle Node of a Linked List | Medium | Linked List, Two Pointers |
| 2130 | Maximum Twin Sum of a Linked List | Medium | Stack, Linked List, Two Pointers |
| 2181 | Merge Nodes in Between Zeros | Medium | Linked List, Simulation |
| 2289 | Steps to Make Array Non-decreasing | Medium | Stack, Array, Linked List +1 |
| 2326 | Spiral Matrix IV | Medium | Array, Linked List, Matrix +1 |
| 2487 | Remove Nodes From Linked List | Medium | Stack, Recursion, Linked List +1 |
| 2807 | Insert Greatest Common Divisors in Linked List | Medium | Linked List, Math, Number Theory |
| 2816 | Double a Number Represented as a Linked List | Medium | Stack, Linked List, Math |
| 369 | Plus One Linked ListPremium | Medium | Linked List, Math |
| 379 | Design Phone DirectoryPremium | Medium | Design, Queue, Array +2 |
| 426 | Convert Binary Search Tree to Sorted Doubly Linked ListPremium | Medium | Stack, Tree, Depth-First Search +4 |
| 708 | Insert into a Sorted Circular Linked ListPremium | Medium | Linked List |
| 1265 | Print Immutable Linked List in ReversePremium | Medium | Stack, Recursion, Linked List +1 |
| 1634 | Add Two Polynomials Represented as Linked ListsPremium | Medium | Linked List, Math, Two Pointers |
| 1756 | Design Most Recently Used QueuePremium | Medium | Design, Array, Linked List +3 |
| 1836 | Remove Duplicates From an Unsorted Linked ListPremium | Medium | Hash Table, Linked List |
| 2046 | Sort Linked List Already Sorted Using Absolute ValuesPremium | Medium | Linked List, Two Pointers, Sorting |
| 2674 | Split a Circular Linked ListPremium | Medium | Linked List, Two Pointers |
Hard (7)
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 23 | Merge k Sorted Lists | Hard | Linked List, Divide and Conquer, Heap (Priority Queue) +1 |
| 25 | Reverse Nodes in k-Group | Hard | Recursion, Linked List |
| 432 | All O`one Data Structure | Hard | Design, Hash Table, Linked List +1 |
| 460 | LFU Cache | Hard | Design, Hash Table, Linked List +1 |
| 1206 | Design Skiplist | Hard | Design, Linked List |
| 2296 | Design a Text Editor | Hard | Stack, Design, Linked List +3 |
| 716 | Max StackPremium | Hard | Stack, Design, Linked List +2 |
Keep exploring
All LeetCode topicsEvery tag with a page of its own, with the number of problems behind each.LeetCode patternsThe techniques themselves, with a Python template and complexity for each.Curated study listsBlind 75, NeetCode 150 and three more, grouped by pattern.Easy problemsStart here when the data structure is new rather than the problem.
Other topics
- Array1,569
- String672
- Hash Table588
- Math485
- Dynamic Programming481
- Sorting392
- Greedy346
- Depth-First Search289
- Binary Search253
- Database249
- Tree225
- Breadth-First Search223
- Matrix216
- Two Pointers201
- Bit Manipulation194
- Binary Tree174
- Heap (Priority Queue)163
- Prefix Sum157
- Stack157
- Simulation144
- Graph138
- Counting126
- Design122
- Sliding Window116
When the Linked List problem arrives live
Stealth Interview is a desktop app for macOS and Windows. It reads the coding problem off your screen, returns a working solution with a step-by-step explanation and its time and space complexity, and transcribes what the interviewer is saying — while staying invisible to screen sharing.