Round 1: Find median of stream of integers Given n sorted arrays of int. Sort all fo them and return the final sorted array. Round 2: Design shared pointer in cpp Traverse tree in one thread and print values in another Design a memory manager which can minimize the number of system calls to get the memory

Process was very smooth. It consists of 1 written and 4 face to face interview rounds. All rounds were taken in single day except final round which was taken day after.