Round-1 (Screening Technical Interview )
Q. Given an array and a matrix. You have to find if the array is present in the matrix. You can start from any point and go in 4 directions. Return the starting and ending pairs of indices if the array exists otherwise return false.

Round-2 (Technical Interview - 1)
Q. Given a matrix of 0s and 1s, find the shortest path from start to end(both given). You can move in 4 directions and can travel only through 0s.

Round-3 (Technical Interview - 2)
Q. Create a treasure hunt and find the treasure which is present in one of the n rooms. You have r keys (key means key to move from one room to another, but you don't know which key is of which pair of rooms). Start point - Room 1.

Round-4 (Technical Interview - 3)
Q. a) There are n jobs, you have to schedule the jobs on a machine. Given the job start time and duration. Schedule the jobs is best optimal way.
b) In continuation of the above question, there are k machines. Schedule the jobs in the most optimal way.

Round-5 (Technical Interview - 4)
Q. Given a city where you have roads, buildings, parks etc which given dimensions and some portion of the city is free (plot of area can be used to build a building). Your task is to find in how many ways can you build a building of a given dimension(rectangle).

Round-6 (Googlyness - Behavioral Interview)

1. Tell me something about yourself.
2. What differentiates yourself from others.
3. Little discussions over my extra activities written in resume.
4. Team Conflict questions.
5. Do you have any Location constraints?
6. Others behavioral questions.

Tips:-

1. Keep discussing your thought process.
2. Be calm & answer politely.
3. Be expressive and thoughful.
4. Better communication is a must.
5. Code should be simple and clean.
6. Practice a lot.
7. Keep the constraints in mind like naming, edge cases, datatype, size, time complexity, space complexity.
8. Don't jump to the solution. Go with the flow.

Result : Not selected
All the rounds went well except the treasure hunt one.