Google Software Engineer Interview Experience
Software Engineer
Summary
AI Powered
The Google interview experience consisted of five rounds, focusing on a variety of technical and behavioral assessments. Candidates can expect to tackle CPU scheduling challenges and matrix manipulation problems in the first two rounds, followed by BFS and graph-related questions. The later rounds delve into behavioral assessments, including handling team dynamics and time management. Overall, the experience is technically rigorous and demanding, making candidates demonstrate strong problem-solving skills throughout the process.
1
2
Given a matrix of distinct positive integers representing heights, find the final destination for raindrops on all cells. A raindrop flows to the lowest adjacent cell.
**Input:**
2 4 6 8
5 9 1 3
10 13 7 20
**Output:**
0 0 0 0
0 1 1 0
0 0 0 0
Given a matrix of distinct positive integers representing heights, find the final destination for raindrops on all cells. A raindrop flows to the lowest adjacent cell.
**Input:**
2 4 6 8
5 9 1 3
10 13 7 20
**Output:**
0 0 0 0
0 1 1 0
0 0 0 0
matrix-manipulation
adjacent-cells
water-flow
Medium
In this variation of the previous problem, raindrops can flow to any lower adjacent cell. Find the final destinations for all matrix cells.
**Input:**
2 4 6 8
5 9 1 3
10 13 7 20
**Output:**
0 0 0,1 0,1
0 0,1 1 0,1
0 0,1 0,1 0,1
In this variation of the previous problem, raindrops can flow to any lower adjacent cell. Find the final destinations for all matrix cells.
**Input:**
2 4 6 8
5 9 1 3
10 13 7 20
**Output:**
0 0 0,1 0,1
0 0,1 1 0,1
0 0,1 0,1 0,1
matrix-manipulation
water-flow
adjacent-cells
Medium
3
Given a list of edges representing connections between countries (0 to n-1) and a list of banned countries that cannot be visited, find the shortest path from a specified source to a destination. Use BFS and keep track of previous countries.
Given a list of edges representing connections between countries (0 to n-1) and a list of banned countries that cannot be visited, find the shortest path from a specified source to a destination. Use BFS and keep track of previous countries.
bfs
graph-theory
pathfinding
Hard
4
5
dynamic-programming
subsequences
coding-challenge
Refer to the problem on LeetCode regarding the longest continuous increasing subsequence.
Refer to the problem on LeetCode regarding the longest continuous increasing subsequence.
dynamic-programming
subsequences
coding-challenge
Medium
Refer to the problem from GeeksforGeeks about the longest increasing subarray with one change allowed.
Refer to the problem from GeeksforGeeks about the longest increasing subarray with one change allowed.
dynamic-programming
subarrays
coding-challenge
Medium
A
Anonymous
Anonymous User
⌘/Ctrl+D
Bookmark for later