Morgan Stanley Interview Experience by sakshi sharma

New update is available. Click here to update.

Digital Technology Intern

Morgan Stanley

3 rounds | 5 Coding problems

Sakshi Sharma

Fresher | Sep 2020

Selected

1740 views

0 comments

9 upvotes

Interview preparation journey

Preparation

Duration: 6 months

Topics: Data Structures,Algorithms,Operating System,DBMS,OOPS concept,Low Level Design

Tip

Tip 1 : Practice all the data structures thoroughly and know about the basic concepts behind them and their use cases in real world.
Tip 2 : Be thorough with your resume .
Tip 3 : Be confident while answering the questions and be honest about your work.

Application process

Where: Campus

Eligibility: 7.5 CGPA and above

Resume tip

Tip 1 : Keep your resume crisp and to the point.
Tip 2 : Have a thorough understanding of the technologies used in the project and why was that specific technology chosen.

Interview rounds

Round

Medium

Online Coding Interview

Duration120 minutes

Interview date1 Sep 2020

Problems0

Round

Medium

Video Call

Duration60 minutes

Interview date3 Sep 2020

Problems4

Second largest element in the array

You have been given an array/list 'ARR' of integers. Your task is to find the second largest element present in the 'ARR'.

Note:

Problem approach

I traversed the array twice. In the first traversal, I found the maximum element. In the second traversal I found the greatest element less than the element obtained in the first traversal.

Try solving now

Minimum Number of Platforms

You have been given two arrays, 'AT' and 'DT', representing the arrival and departure times of all trains that reach a railway station.

Problem approach

I took a variable to count the number of platforms required at a particular time and a final ans variable. I took 2 arrays one for arrival time and the other for departure time and sorted both the arrays. Then I took 2 pointers at the start of each array and compared the timings pointed by the 2 variables. If the smallest time was of arrival I incremented my count variable otherwise decremented...

Try solving now

Boundary Traversal

You have been given a binary tree of integers. Your task is to print the boundary nodes of this binary tree in Anti-Clockwise direction starting from the root node.

NOTE:

Problem approach

First I printed the left-most boundary of the tree, then I printed all the leafs of the tree, and then the rightmost boundary in reverse order using recursion.

Try solving now

System Design

I was asked to design a parking lot in which there were 3 vehicles of small, medium, and large size. There were 3 types of slots for the vehicles small, medium, and large size. The small-sized vehicle can be parked in any of the 3 types of lots, medium-sized vehicles can be parked in only medium and large-sized lot and the large vehicles can be parked in a large-sized lot only. I had to design ...

Problem approach

I created 3 maps for small, medium, and large-sized parking lots and classes for the vehicles and the parking lots using OOPS concepts. I created a function that took a vehicle for parking and looked for the smallest parking lot in which it can fit, if the smaller parking lot was not available I looked for the bigger ones and so on.

Round

Medium

HR Round

Duration45 minutes

Interview date5 Sep 2020

Problems1

Next Greater Number