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.
Only got the OA - they give you test cases for smaller input than the one they test the code against. Not sure where my code broke because they didn't provide the large input test case, although they tell you the range of input size
Interview questions [1]
Question 1
They had 2 questions - the first is easier than the second
x1 OA followed by 4 rounds of virtual online interview with current employees. Was tested on a simple plain text IDE and primarily testing your thought process as opposed to final execution
Interview questions [1]
Question 1
They asked a few technical questions, primarily simple traversal and string manipulations that might build on top on the simple questions to become harder