SDE - Intern
Morgan Stanley
3 rounds | 9 Coding problems
332 views
Interview preparation journey
Preparation
Duration: 2.5 months
Topics: Data structures, Algorithms, Operating systems, OOPS, DBMS
Tip

Tip 1 : Code as many as questions as you can if you have time, even if you think you know the answer.
Tip 2 : Know the projects which you mention.

Application process
Where: Campus
Eligibility: 7 CGPA
Resume tip

Tip 1 : Have 1-2 programming projects on resume.
Tip 2 : Know about the projects in detail (not necessarily in deep).

Interview rounds
01
Round
Medium
Online Coding Interview
Duration100 minutes
Interview date1 Aug 2018
Problems3
Missing Vertex In Parallelogram

#### Eucl...

view more
Problem approach

sum of opposite coordinate is same. So in a parallelogram ABCD, A+C = B+D (A, B, C, D denote the position vectors)

Vertex Cover Problem
view more
0 1 Knapsack

#### A thief is robbing a store and can carry a maximum we...

view more
Problem approach

Did not get full marks in it.
Used DP[idx][weight1][weight2] where this denotes that we are on bag number idx and we can have weight1 more weight in knapsack 1 and weight2 more weight in knapsack 2. Now the transition is just like normal knapsack.

02
Round
Medium
Face to Face
Duration50 minutes
Interview date5 Aug 2018
Problems2
Travelling salesman problem

#### Given a list of cities numbered from 0 to N-1 and a matrix 'DISTANCE' consisting of 'N' rows and 'N' columns ...

view more
Convert number to words

#### For example you are given integer N = 2234 then you have to return the string “two thousand two hundred and thirty four”...

view more
Problem approach

Explained the approach like above, it is a implementation based problem. Interviewer didn't ask for whole code.

03
Round
Medium
Face to Face
Duration50 minutes
Interview date5 Aug 2018
Problems4
Min stack

#### Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

``````1. Push(num): Push the given number in the stack.
2. Pop: Remove and return the top ele...``````
view more
Problem approach

Told him I knew the question already so he switched to the next question.

The Celebrity problem

#### There are ‘N’ people at a party. Each person has been assigned a unique id between 0 to 'N' - 1(both inclusive). A celebrity is a person who is known to everyone but does not know anyone at t...

view more
Problem approach

I told the solution same as in the above URL.

Populating Next Right Pointers In Each Node

#### You need to find the ‘next’ node that is immediately right in the level order form for ea...

view more
Problem approach

I had done this question on interview bit already so used the same approach.

Search In A Row Wise And Column Wise Sorted Matrix

#### You are given an N * N matrix of integers where each row and each column is sorted in increas...

view more
Problem approach

I also had done this question on interview bit already so used the same approach.

Start a Discussion
Similar interview experiences
SDE - Intern
2 rounds | 3 problems
Interviewed by Morgan Stanley
1230 views
Java Developer
2 rounds | 6 problems
Interviewed by Morgan Stanley
430 views
SDE - 1
4 rounds | 4 problems
Interviewed by Morgan Stanley
181 views
Senior Associate
4 rounds | 5 problems
Interviewed by Morgan Stanley
90 views
Companies with similar interview experiencs
SDE - Intern
2 rounds | 3 problems
Interviewed by Trilogy Innovations
16838 views