Exp : 1year 8months
MTS 2
Round 1
2 Leetcode Mediums
Round 2
Given a running stream of integers , fetch the rank of integer( Rank means count of elements less than current element)
Mostly focused on choice of datastructure, timecomplexity.
Solution was to store the coming stream in a BST along with rank,
The interviewer asked to write the code from scratch
Round 3
Round 4
Round 5
Result:- Rejected, couldnt answer the OS questions in last round and instead of LCA of BST i wrote code for LCA of binary tree(stupid Mistake).
Interviewers very friendly and helpful.