← 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: Intern
Round: Phone Screen · Type: Coding · Difficulty: 6/10 · Duration: 90 min · Interviewer: Neutral
Topics: Dynamic Programming, Time Complexity, Space Complexity, Union Find, Graph Traversal
Location: San Francisco Bay Area
Interview date: 2026-01-31
Question: LeetCode 198. The follow-up questions involved analyzing the time and space complexity, optimizing the algorithm, and adding new features, such as returning the index list of points when returning the max point.
Question: LeetCode 2092. I struggled with how to determine which people should be placed in the group and which should not when the timestamps were the same. I asked for a hint, briefly discussed my ideas, but didn't finish the problem. The solution should use Union Find or Graph Traversal.
I had two back-to-back rounds, each lasting 45 minutes. During the interviews, I was given only a text editor. I had to define variables and test cases myself, but the code didn't need to be fully runnable.
In the first round, I solved LeetCode 198. The follow-up questions involved analyzing the time and space complexity, optimizing the algorithm, and adding new features (i.e., whether it's possible to return the index list of points when returning the max point).
In the second round, I worked on LeetCode 2092. I struggled with how to determine which people should be placed in the group and which should not when the timestamps were the same. I asked for a hint, briefly discussed my ideas, but didn't finish the problem. The solution should use Union Find or Graph Traversal.
LeetCode similar: LeetCode 198, LeetCode 2092