Level: Mid-Level
Round: Full Journey · Type: Multiple Types · Difficulty: 4/10 · Duration: 120 min · Interviewer: Neutral
Topics: Breadth-First Search, Graph Algorithms, Sampling, AI Research, Reinforcement Learning
Location: Mountain View, CA
Interview date: 2025-12-08
Question: I was asked a classic Breadth-First Search (BFS) problem. I needed to use a dictionary to establish graph relationships and then use BFS to search. I completed it in about 15 minutes, followed by two or three follow-up questions. The interviewer was very friendly and did not try to make things difficult for me.
Question: I was asked a practical application question, specifically to write a sampling program. Due to spending a significant portion of the time discussing my research with the interviewer (who was familiar with my PhD school), I had limited time and used pseudocode to outline the solution before fleshing it out. The interviewer was very friendly and did not try to make things difficult for me.
Question: Interview with the Ads AI team (NYC). The host described the team as consisting of research scientists and research engineers. The project involved RL-related research, with the goal of publishing papers or technical reports. After the interview, I felt my skills might not be up to par, given the impressive backgrounds of the team members. However, I was selected, possibly due to my genuine enthusiasm.
Question: Interview with a GCP team (Kirkland). The location was appealing, but the team focused on infrastructure, which didn't align with my background. The project involved developing an agent to assist programmers with debugging.