I applied through a staffing agency. I interviewed at Morgan Stanley (Hong Kong) in Aug 2024
Interview
Three rounds of interviews in total.
First Round: Technical interview discussing your previous projects + one system design question.
Second Round: Technical interview with one leetcode-style problem. Leetcode hard level.
Final Round: A behavioral interview with the hiring manager and ED, during which you will discuss your previous experiences, your reason for leaving the previous company, and your motivation.
Interview questions [1]
Question 1
Directed graph problem; Why do you want to leave your previous company; Why Morgan Stanley.
I applied online. I interviewed at Morgan Stanley (Glasgow, Scotland)
Interview
3 total rounds
1. 30m phone screen where I was asked about my experience and some basic Java-related questions.
2. 1h technical interview where I was asked more Java-related questions and had to implement a sorting algorithm by hand.
3. Final 4h interview where multiple interviewers that spanned system architecture, coding/algorithms, and behavioural questions.
After all that process, the recruiter never bothered to get back to me. I followed-up after a week and was informed that they're still making final decisions. No answer after that.
Interview questions [1]
Question 1
Explain the architecture of a system that you currently work with
I applied online. I interviewed at Morgan Stanley (Budapest) in Feb 2026
Interview
Very enjoyable interview, the interviewers tried to dig deep in my skills, they weren't just passive listeners. Gave me an example of what it is like to work in this specific team.
It was for the role Software Engineer - Java Developer. Hr reached out to discuss about the role. There were 2 rounds of technical interview.
Each round will consist of 1 hour interview.And then followed by an hr round.
Interview questions [1]
Question 1
Mainly focused on dsa and java
Asked to sort list of employees based on its id using java8.
Given an array and target, find the indices from the array whose sum is equals to the target. The solution should be in O(n)