← Back to experiences
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/experiences/…$
Level: Unknown Level
Round: Online Assessment · Type: Coding · Difficulty: 7/10 · Duration: 90 min · Interviewer: Unfriendly
Topics: Dynamic Programming, Optimization
Location: San Francisco, CA
Interview date: 2026-01-15
I had a 90-minute online assessment with two coding questions. One question was a standard interview question.
The problem involved multiple services that can be scaled up multiple times. Each scaling increases throughput but also increases costs. The input to the (i+1)th service comes from the ith service.
The goal is to maximize throughput without exceeding a total budget.
Input: throughput list, scalecost list, budget
Output: max throughput