← 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: Mid-Level
Round: Online Assessment · Type: Coding · Difficulty: 7/10 · Duration: 60 min · Interviewer: Neutral
Topics: Dynamic Programming, Greedy Algorithms
Location: Seattle, WA, US
Interview date: 2026-04-30
Got offer: False
I had an online assessment with two coding problems.
I had an online assessment with the following two questions:
Question 1: Given a workList and two work handlers to consume the job in workList. Also given two lists, longTimePrepare and shortTimePrepare:
If the handler first time handles workList[i] or the last work is not the same, the cost is longTimePrepare[i]. If the handler's last work is the same, the cost is shortTimePrepare[i].
Output: minTime
Example: worklist = [1, 2, 2] // worklist stores work IDs longPrepTime=[4, 5] shortPrepTime=[2, 3]
minTime = 4 + 5 + 3
Question 2: I came across this in https://www.reddit.com/r/leetcod...oblem_in_amazon_oa/