A DP question was asked . it was dp on strings. I have to explain the dp recursion as well as dp approach. I had to write code on leetcode playground. The question was of med-high difficulty level.
Interview questions [1]
Question 1
Networking Questions was asked about tcp and udp their differences
2 dsa rounds with one manger round. Dsa questions easy to medium. Mostly leetcode medium. Managerial round around experience and projects done. Dsa question contained dp medium level problems , adhoc problems, binary search etc. 1 hour for each round. Since it was in person drive got results in same day
Interview questions [1]
Question 1
DP problems , variation of coin change and stair case
The interview began with a challenging question, but I managed to successfully cod the solution and modified it after dry running on test cases to cover the test case.
Overall, this round was challenging, but I managed to handle it well. I rate it as a Hire. In the end, the interviewers asked me if I had any questions for them and I asked them regarding his journey at Google, their team and projects etc.
Interview questions [1]
Question 1
Given that there are N books and M students. Also given are the number of pages in each book in ascending order. The task is to assign books in such a way that the maximum number of pages assigned to a student is minimum, with the condition that every student is assigned to read some consecutive books. Print that minimum number of pages.