← 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: Senior-Level
Round: Full Journey · Type: Multiple Types · Difficulty: 6/10 · Duration: 240 min · Interviewer: Friendly
Topics: AI/ML, Graph Theory, BFS, DFS, C++, Behavioral Questions
Location: San Francisco Bay Area
Interview date: 2026-01-23
Question: The interviewer deeply explored the AI/ML related content on my resume. The interviewer mentioned it was their first time conducting an AI/ML focused interview, and the round felt relatively lenient.
Question: Standard behavioral questions, including failure and conflict scenarios.
Question: A graph theory question from Google's internal question bank.
Question: Questions all related to C++ concepts.
The interviewer focused on the AI/ML projects and experience listed on my resume, asking in-depth questions about my work. I felt this round was new to the interviewer as well, and they mentioned it was their first time conducting this type of interview. The interview felt relatively relaxed and I believe the interviewer was being lenient.
I was asked typical behavioral questions around failures and conflicts I've encountered.
The coding question was a graph-related problem from Google's internal question bank.
Question: Given a set of unordered coordinate points, a start point, an end point, and a function getDistance(x, y) that calculates the distance between two points. Two points are considered reachable if their distance is less than r. Determine whether it is possible to reach the end point from the start point.
My Solution: I suggested using BFS/DFS to construct a graph to solve this.
Follow-up: How would you handle a large dataset? I suggested using a cache to pre-compute distances and avoid redundant calculations. Although I had the right idea, my explanation wasn't very coherent.
This round focused entirely on C++ related topics. It heavily relied on accumulated experience, making targeted preparation challenging. Unfortunately, I did not pass this round. I have passed the general hiring bar and am currently in the team matching phase. I will update with any further progress.