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.

They had 5 rounds, and the last one was very difficult. The aptitude round was to filter the candidates, and many were filtered by the company. The second round was coding skills, and the time allotted for coding was 2 hours.

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.