Google

Two rounds, medium DSA questions. I had to code in Google Docs. The interviewer tried to help. There was no HR round for me, and overall, it went pretty decently, I would say.

Greedy Problem Solve an optimization problem using a greedy approach. Analyze O(n log n) or O(n) time and O(1)/O(n) space. Deque Problem Utilize a deque for efficient operations. Analyze O(n), O(log n) time and O(n) space.

The interviewer was chill and mostly asked about coding problems, specifically algorithmic ones. I was asked by the recruiter to prepare for a pair coding round where I would be sharing my screen with the interviewer and asked to write code following