My first interview was a brief phone screening, which focused on me and my projects.

I was then invited to join an online group meeting on Microsoft Lync, similar to Skype. During this meeting, an HR member spoke to all candidates, discussing the next interview process and answering any questions. There were approximately 35 candidates.

A follow-up email allocated a specific date and time for each candidate to attend the interview at the Sydney Office. On my interview day, there were a total of five interviewers, all senior members of the Microsoft team, and five interviewees. We each had 3-4 one-on-one interviews in separate rooms, rotating between the interviewers. A decision might be made after three interviews, or a fourth interview might be given if needed.

I went through a total of four interviews, each lasting 45 minutes with a 15-minute break in between. The breaks were spent with other candidates and an HR member, discussing Microsoft's work and workplace.

The interviews generally followed this structure:

First 5-15 minutes:

• The interviewer introduced themselves and their role.
• They asked about me, my projects, and my past work (essentially reviewing my resume).

Next 25-35 minutes:

• The interviewer presented one to two problems, for which I provided an implementation on a whiteboard.
• I was then asked to provide test cases for my implementation.

Final 5 minutes:

• I had the opportunity to ask any questions I had for the interviewer.

My Interview Questions:

1. Write a function to determine if a string is a palindrome.
2. a. List expected functionality for the "Linked List" data structure. b. Write a function to reverse a Linked List.
3. a. Write a function to determine if a number is prime. b. Write a function to reverse an integer (e.g., 123 becomes 321) with O(1) space complexity. c. Write a function to round a float to the nearest integer (e.g., 3.14 rounds to 3, 3.56 rounds to 4).
4. Write a function to print all paths of a binary tree to a certain depth/length.

Example: Input: The following binary tree, searching to a depth of 3: 5 /
3 7 / /
1 2 5 8

Output: 5-3-1 5-3-2 5-7-5 5-7-8

Write a function to reverse an integer (e.g., 123 becomes 321), with O(1) space complexity.

Write a function to print all paths of a binary tree to a certain depth or length.