Google TPS L3 India | Cleared, Hiring freeze
Summary
I interviewed for a TPS L3 role at Google in India and successfully cleared the round, though a company-wide hiring freeze means the onsite interviews are currently delayed by a month or two.
Full Experience
Google TPS 13th May, Night interview, Loc - India, Interviewer - USA. The question was from previous year discussions (thanks to @leethard) and had been asked multiple times recently. I would have struggled if I hadn't solved it previously, as the actual question pasted by the interviewer was two paragraphs long with a big test case, making it difficult to understand. However, having solved it multiple times, I easily identified it and didn't panic. The interview was over in 32 minutes. The question given was very lengthy to read. EDIT: My recruiter just called to inform me that I cleared the TPS round but there's a hiring freeze, so onsites might take a month or two.
Interview Questions (1)
The problem involved finding a meeting node 'm' that minimizes the sum of distances from three given cities (A, B, C) to 'm': dist(A,M) + dist(B,M) + dist(C,M). The interviewer presented a lengthy, two-paragraph problem statement with a large test case. An almost equivalent problem is LeetCode's 'Minimum Weighted Subgraph With the Required Paths'.
Preparation Tips
I made a list of approximately 150 frequently repeated Google-specific questions with solutions by analyzing LeetCode discussions from 2023-2025.