The first round was on campus at the university. Then they flew me to MS for the second round at Microsoft's headquarters in Redmond. I had four interviews on that day, each lasting 45 minutes with a 15-minute break between them. There were three technical interviews and one behavioral interview.

My trip to Redmond lasted three days, including travel days.

1. Given a sorted matrix, find an element if it exists.

2. Given an array of integers with positive and negative values, sort it in a way where all negative values are on the left side, keeping the relative order. Do this in place.

3. Given an array of stock values for each day, provide an algorithm to find the maximum profit possible between a buy-day and a sale-day.