New update is available. Click here to update.
Digital Technology Intern
Morgan Stanley
3 rounds | 5 Coding problems
1740 views
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
01
Round
Medium
Online Coding Interview
Duration120 minutes
Interview date1 Sep 2020
Problems0
02
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:
view more
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.

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.

view more
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...

view more
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:
view more
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.

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 ...

view more
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.

03
Round
Medium
HR Round
Duration45 minutes
Interview date5 Sep 2020
Problems1
Next Greater Number

#### You are given a string S which represents a number. You have to find the smallest number strictly great...

view more
Start a Discussion
Similar interview experiences
SDE - Intern
3 rounds | 4 problems
Interviewed by Morgan Stanley
710 views
Software Developer
2 rounds | 6 problems
Interviewed by Morgan Stanley
244 views
Spring Intern
3 rounds | 7 problems
Interviewed by Morgan Stanley
28 views
SDE - 1
3 rounds | 6 problems
Interviewed by Morgan Stanley
22 views
Companies with similar interview experiencs
Digital Technology Intern
4 rounds | 4 problems
Interviewed by GE (General Electric)
568 views