San Francisco Bay AreaJan 15, 2026OnsiteMultiple Types7/10 difficulty
I had an onsite interview. I felt like the team might have already filled the position, and I was just going through the motions. **Round 1:** I spent about half an hour discussing my background and resume. Then, I solved one coding question. The problem invol...
I had a Hackerrank question that I also saw appear in an Uber Online Assessment. The problem was: Given a permutation p of length n, a number k is balanced if there are two indices l, r (1 ≤ l ≤ r ≤ n) such that the numbers [p[l], p[l+1], ..., p[r]] form a per...
00
Seattle, WA, US
Jan 15, 2026
Onsite
Multiple Types
7/10 difficulty
I recently had an onsite interview with Azure, consisting of three coding rounds and one system design round. **Round 1:** The behavioral questions went well, but then I was asked OOD questions. I was completely unprepared, as interfaces and abstract classes a...
058
San Francisco Bay Area
Jan 15, 2026
Onsite
Multiple Types
8/10 difficulty
My interview was for the MAI team. I had a phone screen followed by an onsite interview. **Phone Screen:** The question was similar to LeetCode 287. I was required to achieve both O(1) space and time complexity. I proposed using bubble sort. **Onsite:** **Roun...
055
Seattle, WA, US
Jan 15, 2026
Virtual Onsite
Multiple Types
4/10 difficulty
I had a phone screen, followed by three virtual onsite rounds. **Phone screen:** I started with a self-introduction. Then, I was asked about machine learning fundamentals, including how to avoid overfitting, the concepts of recall and precision, and the differ...
074
Seattle, WA, US
Jan 15, 2026
Full Journey
Multiple Types
4/10 difficulty
### Round 1: Recruiter Screen I had a 30-minute chat where I discussed my past projects, and the recruiter asked a few clarifying questions. --- ### Round 2: Technical Interview An applied scientist asked very detailed technical questions about my previous pro...
078
Seattle, WA, US
Jan 15, 2026
Phone Screen
Coding
6/10 difficulty
I had a phone screen where I was asked two questions: **Question 1:** Given an array `p` of length `n`, determine for each `k` (1 ≤ k ≤ n) whether there exists a contiguous subarray that contains exactly one permutation of the numbers 1 to `k` (regardless of o...
075
Seattle, WA, US
Jan 15, 2026
Phone Screen
Technical Discussion
6/10 difficulty
The phone screen involved an AI Data Exercise. I was provided with data and asked to analyze it in a Jupyter Notebook hosted on HackerRank. The notebook contained data access, starter code, and cells. I could use standard Python libraries such as pandas and ma...
061
Location: Seattle, WA, USReport date: Jan 15, 2026Equity includedBonus included
065
Seattle, WA, US
Jan 14, 2026
Onsite
Multiple Types
6/10 difficulty
I had an onsite interview with Microsoft for a software engineer position. The interview consisted of four rounds. **Round 1:** This round was coding-focused. The questions seemed like standard interview questions, involving follow-up questions. **Round 2:** I...