It took me three weeks just to get the interview. The interview was an algorithmic interview. I was not able to solve it and was refused after the first interview.
Overall, everyone was polite and friendly.
Given a distributed system, in which each machine contains a partial view of a graph (the neighbors list of a subset of the nodes), give an algorithm to find the shortest path between two given nodes, with a minimal amount of bytes sent between nodes (unlimited computation power).
The following metrics were computed from 25 interview experiences for the Google Software Engineer role in Tel Aviv-Yafo.
Google's interview process for their Software Engineer roles in Tel Aviv-Yafo is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Google's Software Engineer interview process in Tel Aviv-Yafo.