Google

One phone interview followed by five on-site interviews. Data Structures and Algorithms questions were asked, focusing on probability, heaps, dynamic programming, and greedy algorithms. No questions were repeated. Overall, a huge amount of brainsto

I was asked to find the "loose median" of a given data stream. This can be done using heaps or maps. It was a LeetCode problem, and I solved it easily.

It went great. I was expecting some hard questions, but they asked me some medium DSA questions. They also asked me some system design questions, which I guess weren't that hard. They also asked questions on my resume projects.