← 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: Senior-Level
Round: Phone Screen · Type: Coding · Difficulty: 6/10 · Duration: 60 min · Interviewer: Neutral
Topics: Arrays, Sorting, Greedy Algorithms
Location: San Francisco Bay Area
Interview date: 2025-12-15
I had a phone screen interview that involved two coding questions.
I had a phone screen interview and was asked two questions:
array = [5, -3, 9, 1]
k = 0 => return: 9
k = 1 => return: 5
k = 3 => return: -3H = Holiday
W = Workday
Given a number of Personal Time-Off days (PTO), maximize the length of the longest vacation you can take. No rollovers.
[W, H, H, W, W, H, W], PTO = 2 -> return 5