← 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: 4/10 · Duration: 60 min · Interviewer: Unfriendly
Topics: Quick Select, Binary Search, Heap
Location: San Francisco Bay Area
Interview date: 2026-02-15
This was a technical phone screen focusing on data structures and algorithms.
I don't remember the exact problems, but they were LeetCode originals. I was asked a Quick Select question. The follow-up question asked what to do with a large amount of data, and I answered to use a heap. I was also asked a binary search question.
They weren't difficult, just prepare these two algorithms, and pay attention to corner cases and avoid dead loops. I didn't handle dead loops well myself, but fortunately, the situations in these two questions were not the kind that would cause dead loops.