I applied online. The process took two months.

First, you have to complete a home assignment of two LeetCode questions in 90 minutes, which I can't remember, but they were of medium difficulty. After that, you're invited for a virtual interview day over Microsoft Teams.

• First interview: I was introduced to the team leader and the role I was going to be assigned to. We talked about my previous experience and education, showcasing a project I was taking part in, and then we went on to do a simple LeetCode question.
• Second interview: This was straight up two LeetCode questions and that's it.

All the interviewers were friendly, professional, and made me feel like they wanted me to succeed. It was a great experience overall. I got a call one day later telling me I got accepted.

Introduce yourself, and showcase a project you took part in. What were the challenges? Which parts were you responsible for? There were also other project-specific questions.- You are given an NxM matrix consisting of '' and '.' values. Return a new matrix of size NxM, such that each '.' is replaced with the number of its neighbors that are equal to '' (Minesweeper problem, but easier).- Given numbers N, M, and X, return a new matrix of size NxM made of '.', such that it has X number of '*' in random locations.- Implement a FastArray: Init(n) initializes the FastArray to be of size n. Set(i, v) sets the value at index "i" to the new value "v". Get(i) gets the value at index "i". SetAll(v) sets all the values to "v" (calling the Set method overrides this for the specific index it was called on). All operations should be at O(1) time complexity.- Implement a BST Iterator: init(root) initializes the BST Iterator with the root of the tree (TreeNode). getNext() returns the smallest value which wasn't returned so far. hasNext() returns True if there are values you haven't returned yet, and False otherwise.