dsa8 min read
Sort List Bottom-Up — O(1) Space Merge Sort on Linked Lists
Master bottom-up merge sort on a linked list for O(n log n) time and O(1) space — eliminating the O(log n) recursive stack. A hard interview problem at Amazon, Google, and Facebook that demonstrates deep understanding of merge sort and linked list mechanics.
Read →