Google

4 rounds. First round, the question was very confusing, and the interviewer refused to explain it. Second was a hashtables-based question. Third was ML & system design. Fourth was on Googleyness.

Asked me 2 LeetCode questions: 1. Maximum absolute difference between the sum of two contiguous sub-arrays. 2. Partition a set into two subsets such that the difference of subset sums is minimum.

There were 4 rounds focused on Data Structures and Algorithms (DSA). The topics covered included Stacks, Trees, Heaps, and Graphs. Time and space complexity were discussed in detail, with multiple follow-ups. Aim to solve LeetCode Medium and Hard