Phone call interview with an easy LeetCode-type question.
On-site interview (remotely) with five interviews:
All required writing code. Questions ranged from medium to hard.
You have two paths, A and B. Each path contains N cities.
You can decide to jump from one path to another or continue in the same path.
Each jump at vertex i will reduce A[i] of the gas.
Continuing in the same path will reduce a constant value from the total gas.
Find the minimal path (from a gas perspective).
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.