Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Morgan Stanley interview experience Real time questions & tips from candidates to crack your interview

Morgan Stanley

3 rounds | 6 Coding
problems

Journey

The company's recruitment process was efficient and hassle-free. I went through a total of 3 rounds, and at each step, the process was smooth and convenient.I had a positive experience throughout the process and found it to be a great experience. The company's recruitment process was well-organized and streamlined, making it easy for the candidate to navigate. Overall, I was impressed with the company's recruitment process and would recommend it to others.

Application story

I got to know about the vacancy and applied on the company's website. The first online assessment was on 16th October 2022. I got the email for online interview on 4th November. The interviews were conducted on Skype call.

Why selected/rejected for the role?

I was rejected as I was struggling with solving complex problems and was not be able to come up with effective solutions in the interview.

Preparation

Duration: 4 Months

Topics: Dynamic programming, DBMS, OS, GRAPHS, trees, algorithms

Tip

Tip 1 : consistently practice the coding problems

Tip 2 : have a good resume

Tip 3 : give online coding contests

Application process

Where: Other

Eligibility: No active backlogs

Resume tip

Tip 1 : good problem solving skills

Tip 2 : communication skills matter alot during interviews

01

Round

Medium

Online Coding Test

Duration100 Minutes

Interview date16 Oct 2022

Coding problem2

It was an online assessment on Hackerrank platform. We can attempt it on the anytime between the given time slot . Mic and camera were on.

```
An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase. We can generalize this in string processing by saying that an anagram of a string is another string with the same quantity of each character in it, in any order.
```

```
{ “abc”, “ged”, “dge”, “bac” }
In the above example the array should be divided into 2 groups. The first group consists of { “abc”, “bac” } and the second group consists of { “ged”, “dge” }.
```

```
1. The sub-array of an array is a continuous part of the array.
2. Consider ‘0’ based indexing.
3. ‘k’ will always be less than or equal to ‘n’.
3. Don’t print anything, just return the integer array ‘count’.
```

02

Round

Hard

Video Call

Duration40 Minutes

Interview date9 Nov 2022

Coding problem2

It was on Skype call between 10:30 am . The interview began on time. The interviewer was friendly and engaging in the discussion.

```
In the above image, areas in green, red, and violet color are all submatrices of the original 4x4 matrix.
```

```
1. Binary valued matrix has only two values in each cell : 0 and 1.
2. A submatrix is a matrix formed by selecting certain rows and columns from a larger matrix.
3. The area of a matrix with 'h' rows and 'w' columns is equal to 'h' * 'w'.
```

Problem approach

1) Construct a sum matrix S[R][C] for the given M[R][C].

a) Copy first row and first columns as it is from M[][] to S[][]

b) For other entries, use following expressions to construct S[][]

If M[i][j] is 1 then

S[i][j] = min(S[i][j-1], S[i-1][j], S[i-1][j-1]) + 1

Else /*If M[i][j] is 0*/

S[i][j] = 0

2) Find the maximum entry in S[R][C]

3) Using the value and coordinates of maximum entry in S[i], print

sub-matrix of M[][]

Problem approach

1.The idea is to use the fact that inorder traversal of Binary Search Tree is in increasing order of their value.

2.So, find the inorder traversal of the Binary Tree and store it in the array and try to sort the array. The minimum number of swap required to get the array sorted will be the answer.

03

Round

Medium

HR Round

Duration40 Minutes

Interview date19 Nov 2022

Coding problem2

In this round the interviewer asked me a puzzle and one coding problem .

```
Input: 'V' = 60
Output: 2
Ninja need to pay two coins only 50 + 10 = 60
```

Suppose we have 3 glasses and 10 coins. The problem is to place odd number of coins in each glass i.e. each glass should contain coins and the number of coins in each glass must be odd and total coins which will be used must be equal to 10.

Problem approach

1. It is not possible to use all 10 coins with each glass having odd number of coins. Therefore, we must think out of box.

2. In the 1st glass place 5 coins which is odd, after that in second glass place 2 coins and in the third glass place 3 coins which is odd.

3. Now, place the entire 3rd glass inside 2nd glass. Indirectly, now 2nd glass contains 5 coins which is odd in nature.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Suppose list1 is [2, 133, 12, 12], what is max(list1) in Python?

Choose another skill to practice

Start a Discussion

Similar interview experiences

SDE - 1

3 rounds | 5 problems

Interviewed by Morgan Stanley

0 views

0 comments

0 upvotes

SDE - 1

2 rounds | 4 problems

Interviewed by Morgan Stanley

0 views

0 comments

0 upvotes

SDE - 1

1 rounds | 3 problems

Interviewed by Morgan Stanley

522 views

0 comments

0 upvotes

SDE - 1

3 rounds | 6 problems

Interviewed by Morgan Stanley

507 views

0 comments

0 upvotes

Companies with similar interview experiences

SDE - 1

5 rounds | 12 problems

Interviewed by Amazon

105411 views

24 comments

0 upvotes

SDE - 1

4 rounds | 5 problems

Interviewed by Microsoft

50293 views

5 comments

0 upvotes

SDE - 1

3 rounds | 7 problems

Interviewed by Amazon

31315 views

6 comments

0 upvotes