### Round 1: AI/ML Technical Knowledge The interviewer focused on the AI/ML projects and experience listed on my resume, asking in-depth questions about my work. I felt this round was new to the interviewer as well, and they mentioned it was their first time c...

The interviewer focused on my past experiences. I spent time explaining the specific protocol I had worked on, detailing the methods I used to solve a challenging NLP problem, and discussing the challenges I faced while collaborating with other annotators.

The coding question was about a virus, with about 4-5 sub-questions. The specifics weren't exactly the same as what I had seen before.

The coding question was to implement an expense and rule system. I finished the first part of the problem within the time limit and my code could run correctly for all the test cases. However, I didn't have time to do the second part.

The coding question I got was: Give one permutation p of 1...n, a number k (1<=k<=n) is balanced if there is a subarray p[l...r] such that the subarray is a permutation of 1..k. Find out if k is balanced for every k and returns a binary string. **My approach:*...

The coding question I received was: Find the cheapest common ancestor for two nodes in a tree. Each node of the tree has a price and knows its parent and children. You are provided with two different nodes of the tree and you must find the one with the cheapes...

**Phone Screen: Object-Oriented Design (OOD)** **Coding 1:** The problem was similar to a LeetCode quadtree problem, but I had to implement the data structure myself, and the numbers within it were not just 0s and 1s. I also had to write code to reconstruct a...

**Problem Statement:** Design a system to handle last-click attribution. We receive two types of events: * `click(timestamp, userId, campaignId)` * `conversion(timestamp, userId)` For each `conversion`, the goal is to attribute it to the most recent `click` ev...