Google TPS 13th May, Night interview, Loc - India, Interviewer - USA
Ques was from prev year discussion itself ( thanks to @leethard ) , and had been asked 4-5 times in the month of March and April.
I would have missed it if i hadn't solved it previously, because the actual ques intv had pasted was like 2 paragraphs, and with a big test case which made the ques difficult to understand, but since i had previously solved it multiple times, could easily identify it out, and didn't panic.
intv got over in 32 mins only

same qes, but was very lengthy to read what the intv gave me.

https://leetcode.com/discuss/post/6176471/google-l4-phone-interview-by-anonymous_u-j3wz/ - run 3x 0/1BFS and calculate summation of distances considering every possbile city 'm' as a meeting node, and take the minimal sum of dist(A,M) + dist(B,M) + dist(C,M)

almost equivalent lc problem :- https://leetcode.com/problems/minimum-weighted-subgraph-with-the-required-paths/description/

Wish me a luck, i have made a list of around 150 very freq repeated ques with solutions by drilling down Leetcode discuss from 2023-2025 range (Google specific), will be posting the entire excel sheet very soon.

EDIT:- rec just called that i have cleared the tps round, and informed that there is a hiring freeze, might take a month or two month for the onsites