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.
Tag
In-Place
18 notes
LeetCode 448: Find All Numbers Disappeared in an Array
Find all missing numbers from 1 to n in O(n) time using in-place index marking.
LeetCode 442: Find All Duplicates in an Array
Find all duplicated numbers in an array in O(n) time and O(1) extra space using index marking.
LeetCode 289: Game of Life
An in-place matrix simulation for computing the next state of Conway's Game of Life using temporary encoded states.
LeetCode 283: Move Zeroes
A two-pointer in-place solution for moving all zeroes to the end while preserving the relative order of non-zero elements.
LeetCode 80: Remove Duplicates from Sorted Array II
A detailed guide to solving Remove Duplicates from Sorted Array II with an in-place two-pointer method.
LeetCode 189: Rotate Array
A clear explanation of rotating an array to the right by k steps using in-place reversal.
LeetCode 186: Reverse Words in a String II
A clear explanation of reversing the order of words in a character array in-place using two reversals.
LeetCode 73: Set Matrix Zeroes
A clear guide to setting matrix rows and columns to zero in place using the first row and first column as markers.
LeetCode 31: Next Permutation
A clear explanation of finding the next lexicographically greater permutation in place using a right-to-left scan.
LeetCode 27: Remove Element
A clear explanation of removing all occurrences of a value from an array in place using a write pointer.
LeetCode 26: Remove Duplicates from Sorted Array
A clear explanation of removing duplicates from a sorted array in place using two pointers.
Array Compaction
Remove elements in-place based on a predicate while preserving the remaining elements.
Array Reversal
Reverse the order of elements in an array in-place using symmetric swaps.
Array Partition
Rearrange elements so that those satisfying a predicate appear before others.
Array Rotation
Rotate elements of an array by a given offset in-place or using auxiliary space.
In Place Merge Sort
Merge sort variant that reduces auxiliary memory by merging sorted ranges inside the original array.
Cycle Sort
Minimizes writes by placing each element directly into its correct position using cycles.