I applied through a recruiter. I interviewed at Morgan Stanley (Montreal, QC) in Nov 2016
Interview
The first step is a phone interview, with mostly technical questions.
The interviewer at this stage seemed very satisfied with his working conditions and really liked his job.
For the second stage the interviewers condescending and vaguely insulting.
The interview was difficult with mostly whiteboard questions on algorithms.
It is probably easier to pass such an interview right after university rather than after many years of work experience.
Video interview and below are first level interview
Recruiter directly contact and scheduled interview.
There are more round also there but I couldn’t clear first which was simple however my prepration was not hood
Interview questions [1]
Question 1
Core java basic questions
How to make Immutable class
Difference between LinkedList and ArrayList
SQL to delete all duplicate just keep one entry
I applied online. I interviewed at Morgan Stanley (Bengaluru) in Jan 2026
Interview
It has 6 rounds, all are technical.
Technical questions related to Java, Spring Boot, Microservices, Kafka.
After 2 and half months, they don't have any answer and put the position on hold. This is totally wasting of time.
I applied through a recruiter. The process took 2 days. I interviewed at Morgan Stanley (Bengaluru) in May 2025
Interview
I found the interview process at Morgan Stanley to be less about meaningful engagement with the candidate and more focused on showcasing the interviewer's own expertise. Rather than fostering a two-way conversation to evaluate mutual fit and problem-solving ability, the interaction felt one-sided and performative. There was a noticeable lack of genuine interest in understanding my background or perspectives, with much of the time spent on complex technical questions seemingly chosen more to impress than assess.
Interview questions [1]
Question 1
1) HashMap, TreeMap (getListOf Employees and Addresses) fetch only Address from Employee List 2) Stream Operation to sort numbers, calculate time complexity 3) Priority queue implementation and insertion order 4) Find Minimum index from a rotated array with minimal time complexity.
