Uber Interview Experience Round 1 – Coding

I recently had my first coding round interview at Uber. The interviewer was a Senior SDE. We started with a brief 5-minute introduction.For the main problem, I was asked to reorder elements of a given sorted array based on the sorted order of their squares. I first discussed a brute force approach (square all elements then sort) but didn't code it. Instead, I proposed and successfully implemented a two-pointer / merge-style approach, leveraging the fact that the input array was already sorted.The interviewer then presented a follow-up question: return the k-th element from the square-sorted order obtained from the previous problem. I extended my earlier logic to find the k-th element. Further optimization was requested, for which I proposed a binary search-based idea. Overall, I felt good about my performance in this round.