1 OA

3 rounds of technical interviews

Then HR call and offer

The OA is pretty difficult, but don't be discouraged. Even if you feel you didn't perform very well, there is still a chance. The same thing goes for technical interviews. Don't give up.

1. Closest Pair of Points

Find the closest pair of points from a set of points in a two-dimensional space. A naive solution could be easy but it takes O(N^2) time and space complexity. A divide and conquer approach could reduce the complexity to O(N log N), but it's really hard to come up with.

1. Technical Interview 1

Basic calculator, similar to LeetCode.

1. Technical Interview 2

Derive the backpropagation formula.

1. Technical Interview 3

Check if a point lies inside some ranges, similar to LeetCode's Range Module.