Google | L3 | Interview Experience | Ghosted by Recruiter

google logo
google
SDE I2 yearsNo Offer
February 1, 20251 reads

Summary

I completed a phone interview with Google for an L3 position, successfully clearing the technical round. However, despite being told I would proceed, the recruiter subsequently ghosted me, leaving the process unresolved.

Full Experience

I submitted an application to Google in November, and their recruiter reached out to me in early December. We discussed my areas of expertise and salary expectations. My phone interview, which was initially scheduled earlier, took place in mid-January.

The interview included a challenging graph-based question. I proposed an initial brute-force approach, which then led to discussions about optimizing with a priority queue and even precomputing priority queues for each node to speed up adjacent node selection. While I wasn't able to fully discuss time complexity or further refinements due to time constraints, I felt I performed reasonably well.

Shortly after the interview, the recruiter followed up, stating that the result would be declared in 2-3 days. Four days later, HR confirmed that I had cleared the phone screen and a different recruiter would contact me the following week to explain the procedure and answer any questions. However, since then, I have received no further communication. Despite sending follow-up emails, I've been continuously told "we will get back to you tomorrow," which has never materialized. I've been effectively ghosted.

Interview Questions (1)

Q1
Router Path Existence with Minimum Distance and Inactive Visited Nodes
Data Structures & AlgorithmsHard

Given n routers placed on a Cartesian plane, along with a source and a destination vertex, the task is to determine whether it is possible to reach the destination.

The constraints for exploration are:

  • Only adjacent vertices can be explored.
  • A vertex is considered adjacent if it has the minimum distance from the current vertex AND remains within a given threshold.
  • Once a vertex is visited, the previously visited node becomes inactive and can no longer be used in subsequent steps.

The goal is to find if a path exists from the source to the destination under these specific constraints.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!