I had one question about graphs and binary trees.
It was about 45 minutes. The interviewer was good.
I didn't submit a perfect solution. I could do better, but unfortunately, I didn't pass the interview.
A binary tree path from source to destination is represented like this:
"UP, UP, UP" forms the path going up from the source.
Then, "LEFT, RIGHT, RIGHT, ..." forms the path going down to the destination.
The following metrics were computed from 4 interview experiences for the Google Software Engineer role in Haifa, Israel.
Google's interview process for their Software Engineer roles in Haifa, Israel is very selective, failing most engineers who go through it.
Candidates reported having very good feelings for Google's Software Engineer interview process in Haifa, Israel.