Linked List
Linked List¶
- 3294. Convert Doubly Linked List to Array II
- 3263. Convert Doubly Linked List to Array I
- 3217. Delete Nodes From Linked List Present in Array
- 3063. Linked List Frequency
- 3062. Winner of the Linked List Game
- 2816. Double a Number Represented as a Linked List
- 2807. Insert Greatest Common Divisors in Linked List
- 2674. Split a Circular Linked List
- 2487. Remove Nodes From Linked List
- 2326. Spiral Matrix IV
- 2296. Design a Text Editor
- 2289. Steps to Make Array Non-decreasing
- 2181. Merge Nodes in Between Zeros
- 2130. Maximum Twin Sum of a Linked List
- 2095. Delete the Middle Node of a Linked List
- 2074. Reverse Nodes in Even Length Groups
- 2058. Find the Minimum and Maximum Number of Nodes Between Critical Points
- 2046. Sort Linked List Already Sorted Using Absolute Values
- 1836. Remove Duplicates From an Unsorted Linked List
- 1797. Design Authentication Manager
- 1721. Swapping Nodes in a Linked List
- 1670. Design Front Middle Back Queue
- 1669. Merge In Between Linked Lists
- 1634. Add Two Polynomials Represented as Linked Lists
- 1474. Delete N Nodes After M Nodes of a Linked List
- 1472. Design Browser History
- 1367. Linked List in Binary Tree
- 1290. Convert Binary Number in a Linked List to Integer
- 1265. Print Immutable Linked List in Reverse
- 1206. Design Skiplist
- 1171. Remove Zero Sum Consecutive Nodes from Linked List
- 1019. Next Greater Node In Linked List
- 876. Middle of the Linked List
- 817. Linked List Components
- 725. Split Linked List in Parts
- 716. Max Stack
- 708. Insert into a Sorted Circular Linked List
- 707. Design Linked List
- 706. Design HashMap
- 705. Design HashSet
- 641. Design Circular Deque
- 622. Design Circular Queue
- 460. LFU Cache
- 445. Add Two Numbers II
- 432. All O`one Data Structure
- 430. Flatten a Multilevel Doubly Linked List
- 426. Convert Binary Search Tree to Sorted Doubly Linked List
- 382. Linked List Random Node
- 379. Design Phone Directory
- 369. Plus One Linked List
- 355. Design Twitter
- 328. Odd Even Linked List
- 237. Delete Node in a Linked List
- 234. Palindrome Linked List
- 206. Reverse Linked List
- 203. Remove Linked List Elements
- 160. Intersection of Two Linked Lists
- 148. Sort List
- 147. Insertion Sort List
- 146. LRU Cache
- 143. Reorder List
- 142. Linked List Cycle II
- 141. Linked List Cycle
- 138. Copy List with Random Pointer
- 117. Populating Next Right Pointers in Each Node II
- 116. Populating Next Right Pointers in Each Node
- 114. Flatten Binary Tree to Linked List
- 109. Convert Sorted List to Binary Search Tree
- 92. Reverse Linked List II
- 86. Partition List
- 83. Remove Duplicates from Sorted List
- 82. Remove Duplicates from Sorted List II
- 61. Rotate List
- 25. Reverse Nodes in k-Group
- 24. Swap Nodes in Pairs
- 23. Merge k Sorted Lists
- 21. Merge Two Sorted Lists
- 19. Remove Nth Node From End of List
- 2. Add Two Numbers