← 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: Junior-Level
Round: Full Journey · Type: Coding · Difficulty: 6/10 · Duration: 240 min · Interviewer: Friendly
Topics: Graph Theory, Union Find, Depth-First Search (DFS), Object-Oriented Design (OOD), Hashmap, Sorting, Frequency Analysis
Location: San Francisco Bay Area
Interview date: 2026-03-31
Question: After a brief self-introduction and a behavioral question, I was given a graph problem. I initially thought of using Union Find, but the interviewer suggested DFS. I didn't finish the code, but I explained my approach and the details to consider in the code.
Question: I was asked around 8 or 9 common behavioral questions. The interviewer didn't dig too deeply but confirmed key aspects of my actions and understanding.
Question: A basic Union Find problem. I skipped the self-introduction and went straight to the problem. I finished early and dry-ran the code. The interviewer gave positive feedback.
Question: About 10 minutes of casual conversation/behavioral questions followed by a standard LeetCode object-oriented design problem, not involving inheritance. I used a hashmap and sorted based on frequency. A follow-up question asked to return a random element based on frequency, which I completed by modifying the code. The interviewer's feedback was positive, or at least not negative.
In the first coding round, I was asked a graph question. My initial thought was to use Union Find, but the interviewer suggested using DFS instead. I didn't manage to complete the code, but I explained my thought process and pointed out the important details of the code.
The first round also involved behavioral questions. I was asked about 8 or 9 common behavioral questions. The interviewer didn't delve deeply into any particular area, but they did confirm key points of how I acted in certain situations to ensure their understanding was correct.
In the second round, I was given a basic Union Find problem. I completed it quickly, before dry-running the code and receiving positive feedback.
The second round also involved a standard LeetCode OOD problem, which I solved using a hashmap and sorting based on frequency. I was then asked to modify the code to return a random element based on frequency. I successfully modified my code, and the interviewer's feedback was positive.