Round1) Screening round...Sort an array of numbers when the data can not fit in a single machine....bombed this one but got call for further rounds\n\nRound2) Coding round....A tree with any number of children and any node can die....find the heirarchy given a particular person.....dont remeber the question entirely but it could be solved using a variant of dfs\n\nRound3) Coding round...find the number of subarrays with sum <=k....used sliding window approach O(n)...this round went well\n\nRound4) System design of API rate limiter....this round went average, I was able to explaing the DS used but not much about other system concepts.\n\nRound5) Design of a read write cache....bombed this round completely\n\nRound6) HM round, basic behaviour questions, this round went very well\n\nyou can expect OS questions like mutex semaphore virtualizationetc in each round\nStatus - Did not get an offer.

Round1) Screening round...Sort an array of numbers when the data can not fit in a single machine....bombed this one but got call for further rounds\n\nRound2) C