Level: Senior-Level
Round: Phone Screen · Type: Coding · Difficulty: 6/10 · Duration: 60 min · Interviewer: Neutral
Topics: CAP Theorem, Dynamic Programming
Location: San Francisco Bay Area
Interview date: 2025-08-15
Got offer: False
I was asked about the CAP theorem and had to explain the trade-offs between Consistency and Availability in the presence of Partition Tolerance. Then, I was given a dynamic programming problem where I had to derive the DP formula first before coding. I ran out of time to fully test my code.
First, I was asked about the CAP theorem. I needed to confirm that with Partition Tolerance (P), you can't have both Consistency (C) and Availability (A). Consistency means getting up-to-date data.
Then, I was given a dynamic programming problem. I had to come up with the DP formula. The interviewer insisted that I write the formula first and didn't allow me to write code initially. I found it hard to write the formula without LaTeX. After a lot of discussion, they finally let me write code with only 5 minutes left. I didn't have enough time to finish it completely and it didn't pass the tests.