Linked List
24 problems
Linked list problems often use the fast/slow pointer (Floyd's algorithm) for cycle detection and finding the middle, and dummy head nodes for clean insertion/deletion. Reverse operations should be done iteratively to avoid stack overflow on large lists.
- 19.Remove Nth Node From End of ListMedium
- 25.Reverse Nodes in k-GroupHard
- 61.Rotate ListMedium
- 86.Partition ListMedium
- 92.Reverse Linked List IIMedium
- 114.Flatten Binary Tree to Linked ListMedium
- 146.LRU CacheMedium
- 160.Intersection of Two Linked ListsEasy
- 237.Delete Node in a Linked ListEasy
- 432.All O`one Data StructureUnknown
- 460.LFU CacheHard
- 641.Design Circular DequeUnknown
- 706.Design HashMapUnknown
- 707.Design Linked ListMedium
- 725.Split Linked List in PartsMedium
- 1290.Convert Binary Number in a Linked List to IntegerEasy
- 1367.Linked List in Binary TreeMedium
- 2058.Find the Minimum and Maximum Number of Nodes Between Critical PointsUnknown
- 2181.Merge Nodes in Between ZerosMedium
- 2326.Spiral Matrix IVHard
- 2807.Insert Greatest Common Divisors in Linked ListMedium
- 3217.Delete Nodes From Linked List Present in ArrayMedium
- 3507.Minimum Pair Removal to Sort Array IUnknown
- 3510.Minimum Pair Removal to Sort Array IIUnknown