Google (August 2026) | Virtual |
- Location
- Virtual
- Posted
- 3 Oct 2026
Summary
I had a virtual interview with Google in August 2026 that included a screening coding round and several Googliness questions.
How it went
Screening round :
Problem Statement:
Rat's Safest Path: You are given an N × N grid where each cell is either land(1) or water (0). A rat starts at a given source cell (sx, sy) and must reach a target cell (tx, ty) by moving one step at a time in the four cardinal directions (up, down, left, right). A cat is located at cell (cx, cy) and remains stationary. The safety of a path is defined as the minimum Manhattan distance from the cat among all cells visited on that path. Your task is to find a valid path from the source to the target that maximizes this safety value. Return the maximum possible safety value. If no valid path exists, return -1. The source, target, and cat positions are valid grid coordinates. The rat may move only to adjacent open cells (up, down, left, right). Followup:
- how will you deal if there are multiple cats.
Round 2:
googliness :
- What is the most challenging project you’ve worked on? Follow up: If you will see similar problem in future how will you approach it now?
- Describe a positive leadership or managerial style you liked from one of your previous managers. How did it influence your work style?
- Tell me about a time you advocated for yourself or someone on your team.
- any project that you have lead and you have proposed it and how you worked on it.
- what are new learnings that you will implement in yourself, so that you perform better in future.
Questions asked (6)
- 01
Rat's Safest Path
Data Structures & Algorithms
You are given an N x N grid where each cell is either land (1) or water (0). A rat starts at a given source cell (sx, sy) and must reach a target cell (tx, ty) by moving one step at a time in the four cardinal directions (up, down, left, right). A cat is located at cell (cx, cy) and remains stationary. The safety of a path is defined as the minimum Manhattan distance from the cat among all cells visited on that path. Your task is to find a valid path from the source to the target that maximizes this safety value. Return the maximum possible safety value. If no valid path exists, return -1. The source, target, and cat positions are valid grid coordinates. The rat may move only to adjacent open cells (up, down, left, right).
- 02
Most challenging project
Behavioral
What is the most challenging project you’ve worked on? Follow up: If you will see similar problem in future how will you approach it now?
- 03
Positive leadership style
Behavioral
Describe a positive leadership or managerial style you liked from one of your previous managers. How did it influence your work style?
- 04
Advocacy example
Behavioral
Tell me about a time you advocated for yourself or someone on your team.
- 05
Lead project proposal
Behavioral
Any project that you have lead and you have proposed it and how you worked on it.
- 06
Future learnings
Behavioral
What are new learnings that you will implement in yourself, so that you perform better in future.