Asked two DP questions, one medium and one hard. Got the brute force for both, but it wasn't enough. They wanted the optimum solution for the medium question and the in-detail thought process for both.
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 the matrix. From each cell within the path, you can move either horizontally or vertically. You may not move diagonally.
The following metrics were computed from 1 interview experience for the Google SWE New Grad role in Palo Alto, California.
Google's interview process for their SWE New Grad roles in Palo Alto, California is extremely selective, failing the vast majority of engineers.
Candidates reported having mixed feelings for Google's SWE New Grad interview process in Palo Alto, California.