โ† Droom questions

Merge sort, heap sort, merging sorted arrays, and O(1) stack middle element

Filed under Droom

The question

Explain and compare merge sort and heap sort in terms of time and space complexities. Detail the logic for merging 3 sorted arrays, in-place heap sort, sorting a stack, and designing a stack to find the middle element in O(1) time.

No write-up yet. Related questions below have one.

Related Droom questions

Collected from public candidate posts and coding forums. Updated Nov 2026.