The test had two algorithmic questions that focused on data structures, recursion, and dynamic programming.
It was on an internal platform similar to LeetCode.
I solved one completely and received partial points on the second.
Given a 2D grid where some cells are blocked and others are open, find the shortest path from the top-left corner to the bottom-right corner. You can move up, down, left, or right, but you cannot pass through blocked cells.
The following metrics were computed from 1 interview experience for the Google Software Internship role in Tel Aviv-Yafo.
Google's interview process for their Software Internship roles in Tel Aviv-Yafo is extremely selective, failing the vast majority of engineers.
Candidates reported having mixed feelings for Google's Software Internship interview process in Tel Aviv-Yafo.