The online test consisted of three questions: two on graphs and one on dynamic programming, in a LeetCode medium to hard style. You were given $n$ non-negative integers representing an elevation map where the width of each bar is 1, and you needed to compute how much water it can trap after raining.
Given $n$ non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
The following metrics were computed from 1 interview experience for the Google Software Engineer (Internship) role in Tokyo, Tokyo.
Google's interview process for their Software Engineer (Internship) roles in Tokyo, Tokyo is extremely selective, failing the vast majority of engineers.
Candidates reported having mixed feelings for Google's Software Engineer (Internship) interview process in Tokyo, Tokyo.