Software Engineer
Rain Drop Flow in Matrix
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
This question was asked in
Google Software Engineer Interview Experience
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.