I completed an online assessment that involved implementing a load balancer simulation.

This was a technical phone screen where I discussed my research project and answered questions about machine learning concepts.

The technical phone screen covered maze algorithms, transformer self-attention mechanisms, and sparse matrix multiplication.

### Round 1: Coding **Question:** Given two arbitrary subsequences, determine if they belong to the same parent sequence. The follow-up involved extending this to n subsequences, which I approached using topological sort, but I ran out of time. --- ### Round 2...

### Round 1: Coding **Question:** LeetCode 198. The follow-up questions involved analyzing the time and space complexity, optimizing the algorithm, and adding new features, such as returning the index list of points when returning the max point. --- ### Round...

### Round 1: Coding **Question:** I had two coding questions in my phone screen. The first involved optimizing resource allocation among virtual machines, and the second involved partitioning a string prefix into equal blocks with consistent character frequenc...

### Round 1: Technical Screening **Question:** Fibonacci sequence using a tree. --- ### Round 2: Virtual Onsite **Question:** Design a key-value store with a hit counter. --- ### Round 3: Coding **Question:** Implement a log writer. --- ### Round 4: Coding **Q...

My phone screen centered on an interval load balancer problem. The task was framed around assigning work over time while keeping capacity and timing constraints in mind.

I had a coding round and a system design round.