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.
18 notes
A clear explanation of deleting a node from a singly linked list when only that node is given.
Find all missing numbers from 1 to n in O(n) time using in-place index marking.
Find all duplicated numbers in an array in O(n) time and O(1) extra space using index marking.
An in-place matrix simulation for computing the next state of Conway's Game of Life using temporary encoded states.
A two-pointer in-place solution for moving all zeroes to the end while preserving the relative order of non-zero elements.
A detailed guide to solving Remove Duplicates from Sorted Array II with an in-place two-pointer method.
A clear explanation of rotating an array to the right by k steps using in-place reversal.
A clear explanation of reversing the order of words in a character array in-place using two reversals.
A clear guide to setting matrix rows and columns to zero in place using the first row and first column as markers.
A clear explanation of finding the next lexicographically greater permutation in place using a right-to-left scan.
A clear explanation of removing all occurrences of a value from an array in place using a write pointer.
A clear explanation of removing duplicates from a sorted array in place using two pointers.
Remove elements in-place based on a predicate while preserving the remaining elements.
Reverse the order of elements in an array in-place using symmetric swaps.
Rearrange elements so that those satisfying a predicate appear before others.
Rotate elements of an array by a given offset in-place or using auxiliary space.
Merge sort variant that reduces auxiliary memory by merging sorted ranges inside the original array.
Minimizes writes by placing each element directly into its correct position using cycles.