LeetCode 876: Middle of the Linked List
A clear explanation of finding the middle node of a singly linked list using slow and fast pointers.
Tag
Linked-List
45 notes
LeetCode 817: Linked List Components
A hash set and linked list traversal solution for counting consecutive components whose values appear in nums.
LeetCode 725: Split Linked List in Parts
A clear explanation of splitting a linked list into k consecutive parts with sizes as equal as possible.
LeetCode 716: Max Stack
A clear explanation of designing a stack that supports push, pop, top, peekMax, and popMax.
LeetCode 708: Insert into a Sorted Circular Linked List
A clear explanation of inserting a value into a sorted circular linked list while preserving the circular sorted order.
LeetCode 707: Design Linked List
A clear explanation of implementing a linked list from scratch using nodes, a dummy head, and a size counter.
LeetCode 706: Design HashMap
A clear explanation of designing a hash map without using built-in hash table libraries.
LeetCode 705: Design HashSet
A clear explanation of designing a hash set without using built-in hash table libraries.
LeetCode 237: Delete Node in a Linked List
A clear explanation of deleting a node from a singly linked list when only that node is given.
LeetCode 234: Palindrome Linked List
A clear explanation of checking whether a singly linked list is a palindrome using fast and slow pointers plus in-place reversal.
LeetCode 460: LFU Cache
A clear explanation of designing an LFU cache with O(1) average get and put operations.
LeetCode 445: Add Two Numbers II
Add two numbers stored in forward-order linked lists using stacks and carry propagation.
LeetCode 432: All O'one Data Structure
Design a data structure that supports increment, decrement, get minimum key, and get maximum key in average O(1) time.
LeetCode 430: Flatten a Multilevel Doubly Linked List
Flatten a multilevel doubly linked list in-place using depth-first traversal and pointer splicing.
LeetCode 426: Convert Binary Search Tree to Sorted Doubly Linked List
Convert a BST into a sorted circular doubly linked list in-place using inorder traversal.
LeetCode 382: Linked List Random Node
A clear explanation of selecting a random linked list node with equal probability using reservoir sampling.
LeetCode 369: Plus One Linked List
A clear explanation of adding one to a number stored as a linked list using the rightmost non-nine digit.
LeetCode 328: Odd Even Linked List
A clear explanation of Odd Even Linked List using in-place pointer rewiring.
LeetCode 206: Reverse Linked List
A clear explanation of reversing a singly linked list using iterative and recursive approaches.
LeetCode 203: Remove Linked List Elements
A clear explanation of removing all linked list nodes with a target value using iteration and a dummy node.
LeetCode 92: Reverse Linked List II
A detailed guide to solving Reverse Linked List II with a dummy node and in-place sublist reversal.
LeetCode 86: Partition List
A detailed guide to solving Partition List with two dummy lists while preserving relative order.
LeetCode 83: Remove Duplicates from Sorted List
A detailed guide to solving Remove Duplicates from Sorted List with one pointer and in-place linked list rewiring.
LeetCode 82: Remove Duplicates from Sorted List II
A detailed guide to solving Remove Duplicates from Sorted List II with a dummy node and pointer rewiring.
LeetCode 160: Intersection of Two Linked Lists
A clear explanation of finding the node where two singly linked lists intersect using two pointers.
LeetCode 148: Sort List
Sort a singly linked list in ascending order using merge sort with fast and slow pointers.
LeetCode 147: Insertion Sort List
Sort a singly linked list using insertion sort by splicing each node into a growing sorted list.
LeetCode 146: LRU Cache
Design an LRU cache with O(1) get and put operations using a hash map and doubly linked list.
LeetCode 143: Reorder List
Reorder a singly linked list in-place by finding the middle, reversing the second half, and merging the two halves alternately.
LeetCode 142: Linked List Cycle II
Find the node where a linked list cycle begins using Floyd’s tortoise and hare algorithm with cycle entry mathematics.
LeetCode 141: Linked List Cycle
Detect whether a linked list contains a cycle using Floyd’s tortoise and hare two-pointer algorithm.
LeetCode 138: Copy List with Random Pointer
Create a deep copy of a linked list with next and random pointers using hash maps or interleaved node cloning.
LeetCode 117: Populating Next Right Pointers in Each Node II
A clear explanation of connecting next pointers in any binary tree using constant extra space.
LeetCode 116: Populating Next Right Pointers in Each Node
A clear explanation of connecting next pointers in a perfect binary tree using constant extra space.
LeetCode 114: Flatten Binary Tree to Linked List
A clear explanation of flattening a binary tree into a linked list in preorder traversal order using recursive depth-first search.
LeetCode 109: Convert Sorted List to Binary Search Tree
A clear explanation of converting a sorted linked list into a height-balanced binary search tree using slow and fast pointers.
LeetCode 61: Rotate List
A clear guide to rotating a linked list to the right by k places using a circular list.
LeetCode 25: Reverse Nodes in k-Group
A detailed explanation of reversing linked-list nodes in groups of k using pointer manipulation and constant extra space.
LeetCode 24: Swap Nodes in Pairs
A detailed explanation of swapping every two adjacent nodes in a linked list using pointer manipulation.
LeetCode 23: Merge k Sorted Lists
A detailed explanation of merging k sorted linked lists using a min heap.
LeetCode 21: Merge Two Sorted Lists
A detailed explanation of merging two sorted linked lists using a dummy node and pointer splicing.
LeetCode 19: Remove Nth Node From End of List
A detailed explanation of removing the nth node from the end of a singly linked list using two pointers and a dummy node.
LeetCode 2: Add Two Numbers
A detailed explanation of the Add Two Numbers linked list problem, including digit-by-digit addition, carry handling, and linked list construction.
1.2 Linked Lists
Singly, doubly, and circular linked lists with operations for insertion, reversal, cycle detection, sorting, and memory pooling.
Strand Sort
Extract increasing subsequences and merge them to form a sorted sequence.