Initially there was a coding round that consisted of 2 questions. Students who solved 2 were shortlisted for interviews. In the first interview I was given a tree and I had to return true if it was height balanced or not. And the next was a hard question on stack. after this he asked 2 sum question. Then followed by few dbms questions. In the second round I was asked to find the length of longest substring without repeating characters. the next question was find the element in a rotated array on log(n) time.
