In the interview, I was asked to explain and implement Merge Sort. I briefly walked them through the divide-and-conquer approach, where the array is recursively divided into halves, sorted individually, and then merged. I discussed its consistent time complexity of O(n log n), its stable nature, and the trade-off of additional space usage. They seemed interested in how I approached edge cases and recursion handling.