← 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: 3/10 · Duration: 60 min · Interviewer: Neutral
Topics: Algorithms
Location: San Francisco Bay Area
Interview date: 2025-05-15
Got offer: False
I had a phone screen interview that involved solving two coding problems.
In the phone screen, I was asked two coding questions.
For the first question whici si Leetcode 994, I completed it in about 5-10 minutes, after which the interviewer immediately moved on to the next question.
The second question was similar to Leetocode 958, where the input was an adjacency list. It was not too difficult. After completing the code, I discussed the time complexity. However, the interviewer insisted that len(list) was not a constant time operation but a linear time operation.
LeetCode similar: LeetCode 994, LeetCode 958