I applied online. I interviewed at Google (Bengaluru) in Jan 2022
Interview
Two rounds of interview with coding testing thinking skills.
Difficulty level was high.
Thoughtful process.
More of data structures questions.
Algorithms and Design patterns included.
Object oriented programming questions were asked. This was the hiring process followed. Managerial rounds were there, following
Interview questions [1]
Question 1
Data structures and algorithms and problem solving
Phone call and asked me three questions. I told the interviewer I use java. So the interviewer ask me about the basic java questions and then ask me oop and coding.
Interview questions [1]
Question 1
/**
* Given an array of jobs with different time requirements,
* where each job consists of start time, end time and CPU load.
* The task is to find the maximum CPU load at any time if all jobs are running on the same machine.
* Input: jobs[] = {{1, 4, 3}, {2, 5, 4}, {7, 9, 6}}
* Output: 7
*/
I applied online. The process took 4 weeks. I interviewed at Google (Zürich) in Sep 2021
Interview
From the beginning of the interview we went straight to the task, with the interviewer presenting me the problem. I first explained my thought process and the explanation for the optimal solution but got the response that it is not clear. So i got asked to start with a suboptimal solution of O(n^2). After the implementation 30 minutes where left, which meant that I can try for the optimal solution, but instead I got 3 questions on modifying my existing code/solution to achieve different results (not initial problem). I dont know why we didnt proceed to try the optimal solution of the initial problem, but my experience was that the interviewer was very passive and not interactive. I was expecting that in that kind of interviews there is a point that you can at least receive a "hint" but didnt receive any. A bit disappointed at the end not taking the chance to try but overall nice new experience
Interview questions [1]
Question 1
Given an array of integers, return the longest subsequence where every next value is 1 bigger than the previous
"Longest Arithmetic Subsequence of Given Difference" leetcode approximately equivalent