Google
Software Engineer
Link to Continuous Increasing Subsequence Problem
Medium
Round 5 (OS 3)General KnowledgeCandidate Selected
Refer to the problem on LeetCode regarding the longest continuous increasing subsequence.
Related Links
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.