Standard: 1 phone screen + 5 on-site technical rounds.

Overall, the interviewers were pleasant. They look for coherent solutions with bug-free code.

Prepare for computer science fundamentals, especially algorithms and data structures.

I was lucky that they did not ask any system design questions.

Find the local minima in an array. A local minimum is defined as a number whose left and right neighbors are greater than it in value.

An array contains integers with the property that a particular number, called the majority element, appears more than 50% of the time. Give an algorithm to find this majority number.

Implement std::vector::push_back().

Also asked for the maximum contiguous subarray problem.

There are n points in a plane. Find the maximum number of points that lie on a line.

In a given binary tree, find the number of elements that lie in a given range.