Asked two DP questions one medium one hard got the brute for both but it wasn't enough they wanted optimum solution for the medium question and in detail thought process for both
Interview questions [1]
Question 1
You are given a 2-D grid of integers matrix, where each integer is greater than or equal to 0.
Return the length of the longest strictly increasing path within matrix.
From each cell within the path, you can move either horizontally or vertically. You may not move diagonally.
The interview process consisted of an initial online assessment with coding problems, followed by a phone screen with a recruiter. After that, there were several technical rounds covering data structures, algorithms, and system design, along with a behavioral interview with the hiring manager.
Interview questions [1]
Question 1
Bad interview experience. interviewer was confused.
I applied through a recruiter. I interviewed at Google (Londres, Inglaterra)
Interview
had a recruiter call where he explained how would the process work and i booked the meeting and had the interview we introduced ourselves and got asked the questions where one focused on the prefix sum which i have solved and had a follow up which i failed in solving
Recruiter Call -> Behavorial Interview/Technical Screen (virtual) -> Onsite (in person)
There may be options to interchange the Coding based technical Screen with a Specialty Round depending on the role. If you pass this round, you are given the opportunity to appear for the onsite.