The phone screen was straightforward, starting with some basic algorithm questions. After a few minutes of discussing my background, we dove into a coding challenge about finding two numbers that sum to a target. I enjoyed explaining both the brute-force method and the optimized hash map approach. The wild part was that I had practiced a similar problem on PracHub just a few days earlier, so it felt familiar.

Following this, there was a technical round focused on machine learning concepts, which went smoothly before I received a written offer. Overall, a positive and engaging experience.

Given an array of integers, find two numbers that sum to a target value.

Start with a brute-force O(n^2) approach, then optimize using a hash map to O(n).

Walk through edge cases:

• duplicates
• negative numbers
• no valid pair

And discuss the space-time tradeoff.