It was a hiring event. One of the recruiters approached me on LinkedIn. Recruiters are too good at this company. She even called me to give feedback instead of just sending a rejection email.

There was a HackerRank technical screen followed by four rounds of onsite interviews in Redmond, Washington.

Three of the interviewers were good. The last one didn't care enough; he was busy with his own tasks. No design questions were asked.

Copy list with random pointer

Is BST or Not: This question wasn't asked to me, but I saw this question written on the other interview room.

Very simple code snippet of a recursion program, transform it to a non-recursive code.

Majority Element II (LeetCode): Online technical screen question.

Given a matrix, write two methods: get(int row, int column) and set(int row, int column, String value). This value can either be a string or a formula like sum(matrix[0][2], matrix[0][3]). Now, whenever you do a get, you have to retrieve the fresh values even if the values have changed.