Google

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.

There were three rounds of interview after getting shortlisted from the online coding assessment. The first round was 1 hour long (45 minutes for DSA plus 15 minutes for managerial questions). The second and third rounds were both 45 minutes and we

There are two rounds of DSA. The company asks questions related to trees and graphs. The questions are basically based on the Minimum Spanning Tree. The first round consists of simple observations on the Sliding Window.