Google

1. A binary search approach can be used for problems solvable with prefix sums. 2. This is a design question involving room allotment, similar to LeetCode design problems like LRU cache, LFU, or snapshot.

The OA was LeetCode medium. I was asked two questions and finished in an hour. I did not pass the technical interview and did not get an offer, but I will apply again. The OA was LeetCode medium. I was asked two questions and finished in an hour. I d

It started with a phone call round, where details about the role were shared. I shared details such as my technical skills and current job role. Then there were three DSA rounds and one behavioral round during the interview.