The prompt from HR described a coding exercise involving building components of a machine learning pipeline. I was able to use Python and standard libraries in a collaborative coding environment like Hackerrank.

I had four rounds of interviews, each lasting 60 minutes. - **Round 1:** A standard object-oriented design question. I don't remember the specifics. - **Round 2:** Behavioral questions combined with an algorithm question on finding the shortest path in a cycli...

## Preparation Tips & Key Takeaways ### What I Learned - Implementing idempotency correctly in APIs requires careful handling of state and potential race conditions. - BFS is a fundamental algorithm, and I need to be very comfortable with its implementation. -...

The interview started with a 10-minute introduction, followed by 15 minutes of high-level discussion on classic ML basics, such as how to select a model based on the problem and the advantages and disadvantages of XGBoost. For the last 15 minutes, I received a...

I had a phone screen with the hiring manager to check my background and determine the interview loop I would follow. In the second round, I was asked to write a resumable data loader. The third round involved AI data practice. I was given an OCR dataset and ha...

### Round 1: Phone Screen The question was to find the celebrity. --- ### Round 2: Coding The first coding question was: **Largest Island:** Given a 1D array of 1s (land) and 0s (water), and a material count, find the largest continuous island that can be form...

I was asked to implement the following two questions: 1. Flip and print a binary tree. 2. Find the longest palindromic subsequence. Due to time constraints, the interviewer said I didn't need to provide the optimal solution, just a working solution.

I interviewed for an MTS role at Microsoft after a recruiter reached out on LinkedIn. **Phone Screen:** The interview started with a discussion about my projects. Then, I was asked a question involving a graph representing GPUs, where GPUs are linked and belon...