40 minutes
2 questions
Very friendly interviewer

1. Merge 2 sorted arrays in-place in O(n) time - https://leetcode.com/problems/merge-sorted-array/ ( Sol: I used 2 pointer approach from last element )
2. Almost a follow up - Merge k sorted lists - https://leetcode.com/problems/merge-k-sorted-lists/ (Sol: MinHeap approach)