Technical Interview 2

Telephonic Screening Round

It was a 45-minute round. 3-4 minutes for introduction and then directly jumping to the question....

Technical Interview 1 :

There is a door, and on both sides, people are in a queue to go to the other side of the door. But there are certain conditions like: At even sec only people can come in, at odd seconds only people can go out. For the first second if there are people at both sides then a person will go out. if the last person has gone in and there is no person to go out then only after 2 seconds next person can go in. It will take one second for each person to go in/out. The question seems confusing but I think the interviewer wants to test implementation skills rather than logical skills as the solution can be created just using if-else statements. I was able to give the solution orally in 5 minutes but when the interviewer asked me to implement. It took most of my time. I was not able to complete the implementation and I ran out of time....

Technical Interview 2 :

Suppose there is a 2d metric and you are at any one cell. There is a cheese in another cell and some cells are water, you can not cross water and you have to reach the cheese. There is a cat in one cell and you have to choose the path in which the distance from the cat should be maximum.I was able to identify this as a binary search problem like aggressive cows with a twist of classic 2d array DP. I was able to solve and implement the code in 15-20 minutes. The interviewer was impressed. She said she was not expecting anyone to solve this in 20 minutes and she took around 5 minutes to find a 2nd question for me. There is an array of integers. The value at any position defines the number of smaller numbers in an original array to the right of it. for example, if the 2nd last number in the given array is 1 that means in the original array there is one number smaller than it in its right. Find the original array. Firstly this question seems confusing. It took me 5 minutes to understand the problem itself but I was able to recognize this is a permutation problem and can be solved through recursion. I gave her a recursive solution, and she asked me to optimise, I was thinking about the states to create DP but then I ran out of time....

Technical Interview 3 :

The interviewer was from Russia and I was not able to clearly understand his accent!...

Googliness round

This round was totally about leadership principles and behavioural questions. Some situation-based questions. Honestly speaking it was nothing compared to what I was thinking. There were no technical or project discussions....