A recruiting agency found me through LinkedIn and told me about the opportunity. Soon enough, I received an online HackerRank test that consisted of 9 questions to be answered in 90 minutes. The first 6 were multiple-choice, and the last 3 were programming problems, all sourced from HackerRank's problem-solving question bank.

The first coding exercises were easy, medium, and advanced, in that order. I could not complete the last two; the second-to-last had a partial solution with timeouts. This was enough to get me to the second round.

I had 3 different interviews with people from 5 or more teams. They all asked briefly about me, but they only cared about the live coding. This was slightly different in all interviews, conducted on a custom HackerRank page where they could see my typing in real-time and made me speak out my thoughts aloud.

This was relatively easier than the first round. I think I fell into the "medior" or "junior" bucket after the first round, so they didn't torture me with hard problems.

Soon after, one of the teams told me they were the most interested in me and we could move on. I then had a call with an Executive Director; it was a standard manager interview. Finally, an HR call was made to me with an offer.

I didn't get to know the people I was going to be working with, and they did not make efforts to sell the job as interesting to me, but they offered 25% more than anyone else.

What are the minimum number of swaps to sort this array (Hackerrank - 1st round - hard)?

Portfolio balances problem from Hackerrank (1st round - medium).

2nd round live coding: java private static void function(int n) { if (n > 0) function(n - 1); System.out.print(n); }

function(5);

What will the call print? What if we change the recursive call to n-- or --n?

2nd round live coding: You don't have to run it, so don't worry about implementing anything outside of what you use. Start from a blank editor and write a function that, given a depth, calculates how many direct friends someone has. If the depth is 2, you have to return the direct friends of the person plus the direct friends of all of his direct friends.

2nd round live coding: From a blank editor, write a function that calculates all possible multiplications between a List of Positions and a List of Scenarios. We do not care about what these are or how the calculation works.