Candidates applying for Java Engineer roles take an average of 30 days to get hired, when considering 1 user submitted interviews for this role. To compare, the hiring process at Morgan Stanley overall takes an average of 27 days.
Here are the most commonly searched roles for interview reports -
I applied online. The process took 4 weeks. I interviewed at Morgan Stanley (Budapest)
Interview
A recruiting agency found me through LinkedIn, told me about the opportunity and soon enough, I got an online hackerrank test that consisted of 9 questions that I had to answer in 90 minutes - the first 6 were multiple choice and the last 3 programming stuff that is in all in the question bank of hackerrank's problem solving section. The first coding exercises were easy, medium and advanced in this order, I could not complete the last two - the second to last with a partial solution with timeouts. This was enough to get me to the second round. 3 different interviews I had, with people from 5 or more teams. They all asked briefely about me, but they only cared about the live coding, which was slightly different in all interviews, it was in a custom hackerrank page, where they could see my typing in realtime and made me speak out my thoughts loud. This was relatively easier than the first round, I think I got 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, so I had a call with an ED... it was 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.
Interview questions [5]
Question 1
What are the minimum number of swaps to sort this array - Hackerrank - 1st round - hard
2nd round live coding:
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 edit and write a function that has that given a depth, calculates the how many direct friends someone has. If 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 and how the calculation works.