I applied through an employee referral. The process took two days.

I appeared for an SDE I interview last month. The overall interview process was divided into four rounds, mostly covering the concepts of data structures and algorithms.

• Round 1: It was a written round consisting of two medium-level coding problems.
• Round 2: There was a review of the code in Round 1 and some basic problems on time complexities.
• Round 3: It was a major round where I was asked a lot of problems on binary trees, binary search, a few ad hoc problems, and a little bit about my resume.
• Round 4: It was a low-level system design round. As a fresher, I was not expecting such a round, but it was more of a healthy discussion about approaching the solution.

The questions were: lowest common ancestor of a binary tree, first missing positive integer in a sorted array, check if a sum can be formed by any pair from an array, and given a matrix of 0s and 1s with each row sorted, find the row with the maximum number of 1s in $O(n+m)$ time.