← 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: Phone Screen · Type: Coding · Difficulty: 6/10 · Duration: 60 min · Interviewer: Friendly
Topics: Arrays, Hash Sets, LRU Cache, Data Structures, Algorithms
Location: San Francisco Bay Area
Interview date: 2026-01-15
Got offer: False
This phone screen consisted of two coding questions: removing elements from an array and implementing an LRU Cache.
I had a phone screen with two coding questions. The interviewer was very nice.
Question 1: Remove elements of array A from array B.
Input: [a, c], [a, b, c, d]
Output: [b, d]
The required time complexity was O(n).
I initially suggested a nested for loop, but the interviewer questioned this. I then converted array A to a set and iterated through array B.
Question 2: LRU Cache. Unfortunately, I completely forgot that LRU Cache is implemented using a doubly linked list. Despite the interviewer's hints, I couldn't write anything after 20+ minutes, and the interviewer seemed resigned.