During the first technical screening, I was asked to solve a classic algorithmic problem: finding the minimum element in a rotated sorted array. The interviewer expected an optimized solution using binary search with O(log n) time complexity, rather than a linear scan. I needed to clearly explain the logic behind detecting the rotation pivot, handling edge cases such as a non-rotated array or boundary conditions, and justify both time and space complexity while walking through sample test cases. In addition to the coding problem, I was also asked several computer science fundamentals questions. For example, I was asked to explain what a thread is, how threads communicate with each other, and how multithreading works in practice. The discussion covered concepts such as shared memory, synchronization mechanisms (like mutexes and locks), race conditions, and potential issues such as deadlocks. The interviewer was interested not only in textbook definitions but also in my understanding of how concurrency is implemented in real systems and what trade-offs exist when using multithreading.