Two parts of Coding and a several questions behavior round. LC and OOP problems, need to give different test cases and try run. Behavior round is chatting and discussing your past experiences.
Interview questions [1]
Question 1
Tell me a obstacle you faced in your past experiences.
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