Merge Intervals
Given an array of intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals and return an array of the non-overlapping intervals that cover all the intervals in the input.
Merge K Sorted Arrays
Merge k sorted arrays into one sorted array using heap
Merge k Sorted Linked Lists
Merge k sorted linked lists into one sorted linked list
Merge Two Sorted Arrays (LC 88) — Two Pointers
LeetCode 88 merge sorted array in-place: reverse two pointers (merge from end) in O(m+n) time, O(1) space. Step-by-step + examples.
Merge Two Sorted Lists
Merge two sorted linked lists into one sorted linked list
Reorder List
Reorder a linked list by interleaving nodes from the beginning and end