Me postulé en línea. El proceso tomó 4 semanas. Acudí a una entrevista en Morgan Stanley (Montreal, QC) en ago 2014
Entrevista
I applied online. One week later, I got an HR interview, then two technical phone interviews and finally a meeting with a final technical interview with a group of developers. The technical interview was very good and they took there time asking all questions about Java from JVM to Resuful services. It was one of the best interviews I have ever gone through, since it covered too much aspects of development.
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
Preguntas de entrevista [1]
Pregunta 1
Core java basic questions
How to make Immutable class
Difference between LinkedList and ArrayList
SQL to delete all duplicate just keep one entry
Me postulé en línea. Acudí a una entrevista en Morgan Stanley (Bengaluru) en ene 2026
Entrevista
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.
Me postulé a través de un reclutador. El proceso tomó 2 días. Acudí a una entrevista en Morgan Stanley (Bengaluru) en may 2025
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 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.
