8.5 YOE - Morgan Stanley (Bangalore) Java developer interview experience.

Anonymous User
770
Mar 19, 2026
May 20, 2026

I have 8.5 YOE currently in a WITCH.

I was invited for Morgan Stanley Virtual Hiring Drive, first 2 rounds happened on the same day and 3rd and 4th rounds were scheduled later based on feedbacks on previous round.

4th Round happened today.

They would test on mix of Java specific questions and typical leetcode style questions.
All coding to be done in Java, but also depends on interviewer if he allows to code in other language.
LLD round for me were more focued on Class Designing and psuedocode for critical logic.

I have been preparing for a long time now so I was prepared for the interviews.

R1 : Tech Round

Q1 - merge intervals
Q2 - find kth largest value in array

Wrote working efficient code for both

R2 : Tech Round

Q1 - Sort a map by values
Q2 - maximum profit on stock trading and you can trade at most 2 times
Q3 - Write Query for 3rd highest salary in employee table
Q4 - questions related to Hashmap internals

I was able to answer all the questions except the SQL one.
I was not able to write the error free SQL query as I'm not hands on with SQL anymore thanks to LLMs.

I had written this "select name from Employee order by salary desc fetch first 3 rows only skip 2"

this is almost a correct query but 'skip' is invalid here so I told the interviewer i'm not sure about 'skip' keyword but query would be like this only.
Rest of the syntax is correct for Oracle DB (I work with OracleDB hence I wrote 'fetch first x rows only').

R3 : Techno - Manegerial Round

Q1 - LLD of Multi Floor Parking Lot,
Q2 - sort positive numebrs to right and negative numbers to left without increasing space complexity sorting should preserve the relative order of numbers
input = [20, -10, 30, 40, -50, -60, 70]
output = [20, 30, 40, 70, -10, -50, -60, 70]
Q3 - Some behavioral Questions

I was able to design classes for Parking Lot.
2nd Question I verbally told him that It can be done with 2 Queues but adding extra space complexity was not allowed so he wanted me to think of something else.
I was able to solve it partially as I was only able to sort positive numbers, but negative numbers were not placed in correct order.
I was trying to do it in O(n) complexity but later got to know that given the constraints of the problem, it could be done in O(n^2).

R4 : Tech Round

Q1 - LLD of some snake and food related mobile game,
Q2 - topological sort problem

Designed all the classes for LLD question, answered all followup questions as well.
Wrote pseudocode for moving logic and game ending logic.
For Topological Sort I wrote code in python and correctly wrote the code for that.

I'm not sure what will be the final outcome so will wait now.

Update

I received verbal offer on 23rd March 2026 and after that they took an entire month for offer approval and yet it never came. Every week HR mentioned "Things are moving, everything's positive, approval takes time", until End of April 2026, Morgan Stanley went into hiring freeze and my offer went on hold.
This was so discouraging as this was supposed to be my first offer after interviewing for over a year. I gave an entire year to interviewing and it all was undone.

Comments (1)