San Francisco Bay AreaJan 20, 2026Phone ScreenCoding, Behavioral3/10 difficulty
I was asked two behavioral questions: 1. Describe conflicts with others at work. 2. Describe a cross-team work experience. For the coding section, I was asked: 1. LeetCode 1249, but only needed to return the numerical value, making it simpler. 2. Leetcode 721,...
I recently completed my onsite interview. Overall, I felt the competition was intense and the bar was high. The questions were of the type where it seems like you've seen them before, but they've been modified. **Coding Rounds:** 1. LeetCode 8, String to Integ...
091
San Francisco Bay Area
Jan 20, 2026
Online Assessment
Coding
3/10 difficulty
The online assessment included the following coding problems: * LeetCode 2529, Pivot Integer (easy) * LeetCode 871, Minimum Number of Refueling Stops (medium) * LeetCode 419, Battleships in a Board (medium) * LeetCode 128, Longest Consecutive Sequence (medium)...
054
San Francisco Bay Area
Jan 20, 2026
Online Assessment
Coding
7/10 difficulty
This online assessment consisted of three parts: --- ## Part 0 Open the `byte_tokenizer.py` file and carefully study the starter code. The starter code contains a `ByteTokenizer` class with a reference implementation of a tokenization algorithm in the `slow_to...
076
Seattle, WA, US
Jan 20, 2026
Online Assessment
Coding
4/10 difficulty
Two leetcode coding questions - LeetCode 56: Merge Intervals ``` from typing import List class Solution: def merge(self, intervals: List[List[int]]) -> List[List[int]]: if not intervals: return [] intervals.sort(key=lambda x: x[0]) merged = [intervals[0]] for...
093
San Francisco Bay Area
Jan 20, 2026
Full Journey
Coding
7/10 difficulty
I was asked the following coding question: A software system logs its execution traces as a sequence of program events, where each event records either a function call or a function return. Each entry in the input list `traces` is one of: - `"-> function_name"...
065
San Francisco Bay Area
Jan 20, 2026
Phone Screen
Coding
6/10 difficulty
During the 60-minute phone screen, I spent about 45 minutes on the coding exercise. The exercise had multiple parts, and I could only unlock the next part after completing the current one. **Part 1: Verify Transaction Data Integrity** This part focused on esta...
082
San Francisco Bay Area
Jan 20, 2026
Full Journey
Multiple Types
6/10 difficulty
Here's my interview experience: **Team Screening:** I had to calculate the order shipping cost. It was divided into 3 parts, and I debugged all the bugs I encountered. Writing test cases for parts 2 and 3 was time-consuming, and understanding part 2 took some...
0104
Los Angeles, CA, US
Jan 20, 2026
Phone Screen
Coding
3/10 difficulty
Part 1: Given a list of episode IDs from a user's viewing history, determine if there are any duplicate episodes. ``` print(has_duplicate_episodes([55, 66, 77, 88, 99])) # return: False (no duplicates) print(has_duplicate_episodes([55, 66, 77, 88, 66])) # retu...
095
San Francisco Bay Area
Jan 20, 2026
Phone Screen
Coding
6/10 difficulty
I was asked to design a deck of cards that supports shuffle and draw functions, ensuring the shuffle and draw probabilities are met. For the object-oriented design aspect, I had to design classes for Deck, Card, etc. I used the approaches from LeetCode's `getR...