Upload Button Icon Add office photos

Morgan Stanley

Compare button icon Compare button icon Compare

Filter interviews by

Morgan Stanley Software Developer Intern Interview Questions, Process, and Tips

Updated 21 Dec 2023

Top Morgan Stanley Software Developer Intern Interview Questions and Answers

  • Q1. Longest Substring with At Most K Distinct Characters Given a string S of length N and an integer K , find the length of the longest substring that contains at most K dis ...read more
  • Q2. Split the String Problem Statement You are given a string str consisting of N lowercase alphabets. Your task is to determine if it is possible to divide the string into ...read more
  • Q3. Sorted Linked List to Balanced BST Problem Statement Given a singly linked list where nodes contain values in increasing order, your task is to convert it into a Balance ...read more
View all 10 questions

Morgan Stanley Software Developer Intern Interview Experiences

4 interviews found

Interview experience
4
Good
Difficulty level
Hard
Process Duration
2-4 weeks
Result
Not Selected

I applied via Referral and was interviewed in Jun 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

3 questions of medium to hard coding questions.

Round 3 - Technical 

(1 Question)

  • Q1. Technical interview including SQL, one programming language, and dbms based questions. the interview went well and was of 90mins.

I appeared for an interview in Nov 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 100 minutes
Round difficulty - Medium

Test started at 04:00 PM sharp and complete the same by 06:00 PM.
The test duration is 100 minutes.
Environment (Amcat) is user friendly and understandable.
Web cam and microphone were also enabled.

  • Q1. 

    Longest Substring with At Most K Distinct Characters

    Given a string S of length N and an integer K, find the length of the longest substring that contains at most K distinct characters.

    Input:

    The first...
  • Ans. 

    Find the length of the longest substring with at most K distinct characters in a given string.

    • Use a sliding window approach to keep track of the characters and their counts within the window.

    • Maintain a hashmap to store the characters and their frequencies.

    • Update the window size and characters count as you iterate through the string.

    • Return the maximum window size encountered for each test case.

  • Answered by AI
  • Q2. 

    Find the Duplicate Number Problem Statement

    Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...

  • Ans. 

    Find the duplicate number in an integer array containing numbers from 0 to (N - 2).

    • Iterate through the array and keep track of the frequency of each number using a hashmap.

    • Return the number that appears twice in the array.

    • The duplicate number is always present in the given array.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Hard

This round was conducted on skype platform. I was shared the invitation link one day prior to the interview and also was told the name of my interviewer. I looked at the profile of the interviewer at linked.in and got a better understanding of what kind of person he was and prepared accordingly. The round was scheduled at 3 :00 pm on 5th Nov and I was eagerly waiting for the clock hands to reach 3 o'clock since morning and finally I went in front of him after wearing a white shirt and a black coat over it along with a tie over it.

  • Q1. 

    Ninja and Binary String Problem Statement

    Ninja has a binary string S of size N given by his friend. The task is to determine if it's possible to sort the binary string S in decreasing order by removing a...

  • Ans. 

    Determine if a binary string can be sorted in decreasing order by removing non-adjacent characters.

    • Iterate through the binary string and check if it can be sorted in decreasing order by removing non-adjacent characters.

    • Keep track of the count of '1's and '0's in the string to determine if it can be sorted in decreasing order.

    • If the count of '1's is greater than the count of '0's, the string can be sorted in decreasing

  • Answered by AI
  • Q2. 

    Split the String Problem Statement

    You are given a string str consisting of N lowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such tha...

  • Ans. 

    Given a string, determine if it can be split into three non-empty substrings where one is a substring of the other two.

    • Check if any substring of the string is a substring of the other two substrings.

    • Iterate through all possible splits of the string and check for the condition.

    • Use two pointers to find all possible substrings efficiently.

  • Answered by AI
Round 3 - HR 

Round duration - 40 minutes
Round difficulty - Easy

This round was scheduled on 15th Nov, almost after 10 days of the previous technical round. I got the confirmation of passing the previous round on 11th Nov and was asked to appear in this final round which was scheduled on 15th Nov at 11:00 am in the morning and it was going to be an HR round which probably was my favourite among all the other rounds. I prepared for by reading interview experiences available at coding ninjas and geeksforgeeks.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. I applied for the job as SDE - Intern in HyderabadEligibility criteriaabove 7.5 cgpa, CS/IT branches were preferredMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Arrays, Linked List, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, greedy algorithmsTime required to prepare for the interview - 10 monthsInterview preparation tips for other job seekers

Tip 1 : practice on gfg and coding ninjas
Tip 2 : compete on codechef and codeforces
Tip 3 : learn DSA and practice regularly

Application resume tips for other job seekers

Tip 1 : Not more than 1 page
Tip 2 : Have atleast 3 projects with some achievement in coding contest and your coding handle should be mentioned like codechef, codeforces etc
Tip 3 : Try to keep only those things in resume in which you find yourself comfortable with

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more

I appeared for an interview in Nov 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Hard

  • Q1. 

    Ways To Make Coin Change

    Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...

  • Ans. 

    Implement a function to determine the total number of ways to make change for a specified value using given denominations.

    • Use dynamic programming to keep track of the number of ways to make change for each value up to the target value.

    • Iterate through each denomination and update the number of ways to make change for each value based on the current denomination.

    • Return the total number of ways to make change for the targ...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 90 Miinutes
Round difficulty - Medium

I was asked 3 coding questions

  • Q1. How would you design a system like Facebook?
  • Ans. 

    Designing a system like Facebook involves creating user profiles, news feeds, friend connections, messaging features, and more.

    • Create user profiles with personal information, photos, and posts

    • Implement a news feed algorithm to display relevant content to users

    • Allow users to connect with friends and follow other users

    • Include messaging features for private communication between users

    • Implement notifications for likes, com...

  • Answered by AI
  • Q2. 

    Sorted Linked List to Balanced BST Problem Statement

    Given a singly linked list where nodes contain values in increasing order, your task is to convert it into a Balanced Binary Search Tree (BST) using th...

  • Ans. 

    Convert a sorted singly linked list into a Balanced Binary Search Tree (BST) using the same data values.

    • Create a function to convert the linked list to a BST by finding the middle element as the root and recursively building the left and right subtrees.

    • Maintain a pointer to the head of the linked list and update it as nodes are processed.

    • Use level order traversal to output the values of the BST nodes, representing NULL...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

This is HR + Technical Round
Started with tell me about yourself asked about projects in depth

  • Q1. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.

    • Use Floyd's Cycle Detection Algorithm to determine if there is a cycle in the linked list.

    • Maintain two pointers, one moving at twice the speed of the other.

    • If the two pointers meet at any point, there is a cycle in the linked list.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in MumbaiEligibility criteriaCV ShortlistingMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Aptitude, Competitive Coding, DataBase, Operating SystemTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Be good with aptitube skills
Tip 2 : Good with data structures and algorithms
Tip 3 : Be confident while explaining

Application resume tips for other job seekers

Tip 1 : Good Projects
Tip 2 : Achievement is good to have

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Nov 2020.

Round 1 - Video Call 

(2 Questions)

Round duration - 50 minutes
Round difficulty - Hard

Timing (10 am- 10:50 am)
For this round I had slightly more time than the last, due to the fact that the weekend fell in between.The interviewer was very very cool and helping this time, something which I kept at the last in my list of probable things that can happen during an interview. Duration of this round was around 50 minutes.

This time I had to face three technical questions and one general question on Finance banks.

  • Q1. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

    • Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the result list based on the criteria mentioned in the problem statement.

  • Answered by AI
  • Q2. 

    Validate BST Problem Statement

    Given a binary tree with N nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true; otherwise, return false.

    A binary search tree (BST)...

  • Ans. 

    Validate if a binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with data less than the node's data.

    • Check if the right subtree of a node contains only nodes with data greater than the node's data.

    • Ensure both the left and right subtrees are also binary search trees.

    • Traverse the tree in an inorder manner and check if the elements are in sorted order.

    • Recursively valid...

  • Answered by AI
Round 2 - HR 

Round duration - 35 minutes
Round difficulty - Medium

There was only one interviewer for this round. He continuously interacted with me and was giving me some good situational problems that were not very easy to answer. Basically those were open-minded questions which can be answered oth ways and that's why I found it quiet hard as per my nature but at the end things went well for me.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Malaviya National Institute of Technology Jaipur. I applied for the job as SDE - Intern in BangaloreEligibility criteriaResume shortlistingMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, hashmap, linked list, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, array, 2-pointer problemsTime required to prepare for the interview - 12 monthsInterview preparation tips for other job seekers

Tip 1 : Practice on gfg and coding ninjas.
Tip 2 : Compete on codechef and codeforces.
Tip 3 : Learn DSA and practice regularly.

Application resume tips for other job seekers

Tip 1 : Not more than 1 page
Tip 2 : Have atleast 3 projects with some achievement in coding contest and your coding handle should be mentioned like codechef, codeforces etc
Tip 3 : Try to keep only those things in resume in which you find yourself comfortable with

Final outcome of the interviewSelected

Skills evaluated in this interview

Morgan Stanley interview questions for designations

 Software Developer

 (17)

 Senior Software Developer

 (2)

 Java Software Developer

 (1)

 Intern

 (1)

 Software Engineer

 (4)

 Summer Intern

 (2)

 Apprentice Intern

 (1)

 Java Developer

 (3)

Interview questions from similar companies

I appeared for an interview before Oct 2020.

Round 1 - Coding Test 

(4 Questions)

Round duration - 180 Minutes
Round difficulty - Hard

There will be 4 programming questions( 3 medium, 1 hard) 
Participants can attempt as many questions as they can within the test duration. The more the number of questions they attempt and get correct, the better their chances of getting shortlisted for interviews.
It was camera monitored. Don't change the tab while attempting the test.

  • Q1. 

    Ways To Make Coin Change

    Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...

  • Ans. 

    The task is to find the total number of ways to make change for a specified value using given denominations.

    • Use dynamic programming to keep track of the number of ways to make change for each value up to the target value.

    • Iterate through each denomination and update the number of ways to make change for each value based on the current denomination.

    • The final answer will be the number of ways to make change for the target...

  • Answered by AI
  • Q2. 

    Count Ways to Reach the N-th Stair Problem Statement

    You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...

  • Ans. 

    The problem involves finding the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.

    • Use dynamic programming to solve the problem efficiently.

    • The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

    • Handle base cases for N=0 and N=1 separately.

    • Consider using modulo operation to avoid overflow when dealing with large numbers.

  • Answered by AI
  • Q3. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space.

    • Create a dummy node to start the merged list

    • Compare the values of the two linked lists and add the smaller value to the merged list

    • Move the pointer of the merged list and the respective linked list with the smaller value

    • Continue this process until one of the linked lists is fully traversed

    • Append the remaining elements of the o

  • Answered by AI
  • Q4. 

    Pattern Matching Problem Statement

    Given a pattern as a string and a set of words, determine if the pattern and the words list align in the same sequence.

    Input:
    T (number of test cases)
    For each test ca...
  • Ans. 

    Given a pattern and a list of words, determine if the words align with the pattern.

    • Iterate through the pattern and words simultaneously to check for alignment.

    • Use a hashmap to store the mapping between characters in the pattern and words.

    • Return 'True' if the words match the pattern sequence, else return 'False'.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 75 Minutes
Round difficulty - Easy

This round was held online over Webex and CodePair (a screen-sharing code editor ).
The interviewer made it clear in the beginning that he wanted to know me as a person, what my interests are, and how well I am as a problem solver. The interview started with my introduction, my interests, coding languages I am comfortable with, my previous internship experiences, and my projects. He then asked some questions about OOPS and data structures. After judging my problem-solving skills and thought process from previous questions, he gave me 2 coding questions to solve. I was able to solve both of them.

  • Q1. 

    Minimum Operations Problem Statement

    You are given an array 'ARR' of size 'N' consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in t...

  • Ans. 

    The minimum operations problem involves finding the minimum number of operations required to make all elements in an array equal.

    • Iterate through the array to find the maximum and minimum values.

    • Calculate the difference between the maximum and minimum values.

    • The minimum number of operations needed is the difference between the maximum and minimum values.

  • Answered by AI
  • Q2. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.

    • Use Floyd's Tortoise and Hare algorithm to detect a cycle in the linked list.

    • Initialize two pointers, slow and fast, and move them at different speeds through the list.

    • If there is a cycle, the fast pointer will eventually meet the slow pointer.

    • If the fast pointer reaches the end of the list (null), there is no cycle

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in PuneEligibility criteriaFemale candidates BE/BTech/ M.E/M.Tech/ MCA/ M.Sc. & MS Maths and Computing CGPA 7 and above No current/active backlogsBNY Mellon interview preparation:Topics to prepare for the interview - DSA, OOPS, Projects, Leadership Principles, JavaTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : The interviewer will not only look at your technical skills but also your team building and leadership qualities
Tip 2 : It's okay if you don't have an optimal solution in one go. Try to break the problem and don't give up. 
Tip 3 : Practice at least 150 Questions on Leetcode covering all topics. Chances of asking tough topics like DP, greedy are less. 
Tip 4 : Make sure you have at least 1 project to discuss in depth. Be prepared with all challenges you had while doing the project and how you overcome them. 
Tip 5 : If you ever participated in/organized a hackathon/college event, make sure you highlight that. This will make you shine from the rest of the candidates.
Tip 6 : The interviewer might also give you a couple of leadership/team-based scenarios and what will you do in that situation.
Tip 7 : Lastly make sure to read about BNY Mellon and what it do.

Application resume tips for other job seekers

Tip 1 : Try to add Experience at the top with a detailed explanation of work done by you 
Tip 2 : If No projects and Experience: Try to add Coding profiles, Achievements (Hackathons and Coding Competitions )
Tip 3 : Make sure to highlight any competition/hackathon that you won.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via LinkedIn and was interviewed in Feb 2021. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. - Data Structures and Algo - Core Python specific questions
  • Q2. - Design a Cache and some design based questions

Interview Preparation Tips

Interview preparation tips for other job seekers - I actually attended a Weekend drive. So in the 1st round almost related to 2/3 DS Algo questions.
2nd round was related to design small cache and little bit on python questions.
3rd round was managerial and some basic technical questions.

I appeared for an interview before Nov 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

It was in the evening at about 7 pm. The test platform was quite user friendly and easy to use.
There were 3 sections in test. One was logical ability, second was english, third was coding 
Questions were of medium difficulty.

  • Q1. 

    Ways To Make Coin Change

    Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...

  • Ans. 

    The task is to find the total number of ways to make change for a specified value using given denominations.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 1D array to store the number of ways to make change for each value from 0 to the target value.

    • Iterate through the denominations and update the array based on the current denomination.

    • The final answer will be the value at the target index of the ar

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Medium

It was a 30 minute interview. In which I was provided with questions on data structures and algorithms to check my problem solving skills.

  • Q1. 

    Non-Decreasing Array Problem Statement

    Given an integer array ARR of size N, determine if it can be transformed into a non-decreasing array by modifying at most one element.

    An array is defined as non-de...

  • Ans. 

    Determine if an array can be transformed into a non-decreasing array by modifying at most one element.

    • Iterate through the array and check if there are more than one decreasing elements.

    • If there is only one decreasing element, check if modifying it can make the array non-decreasing.

    • Return true if the array can be made non-decreasing by modifying at most one element, otherwise false.

  • Answered by AI
Round 3 - Face to Face 

Round duration - 40 Minutes
Round difficulty - Medium

In this round , interviewer discussed about my resume. As I had done a internship in sql and database so he asked me questions related to dbms and sql queries.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in PuneEligibility criteriaAbove 7.5 cgpaCiti Bank interview preparation:Topics to prepare for the interview - Data structures, oops, algorithms, operating system, dbms, pointers, dynamic programmingTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : practice data structures and algorithms thoroughly
Tip 2 : do atleast 2 project
Tip 3 : maintain a decent cgpa (above 8.5)

Application resume tips for other job seekers

Tip 1 : write all your academic achievements on resume
Tip 2 : do not write false things in resume
Tip 3 : be thorough with your resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. I was mostly asked about the process. First round was technical, mostly on Java
  • Q2. JVM Architecture, Java 9 new feature, collection framework, hibernate
  • Q3. 2nd round was mostly on tools and processes.

Interview Preparation Tips

Interview preparation tips for other job seekers - Always come prepare with whatever you have mentioned in your resume, if you talking about any tools, you should have end to end knowledge on that, you can't say I used Jenkins and then while answering, you would say I don't know how to create a job or pipeline. That kind of answer is not acceptable.

Interview Questionnaire 

1 Question

  • Q1. 1)Questions were asked related to Oracle plsql langauge and 2) Performance tuning and about 3) my data science master program,and like 4)my most challenging task ever I faced in my carrier.

I applied via Recruitment Consulltant and was interviewed before Mar 2021. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Java and OOPS Associated Questions
  • Q2. Spring and Basic Programming Like Sort, Searching

Interview Preparation Tips

Interview preparation tips for other job seekers - Don't bother to give interviews it's not a good place to work for.

Morgan Stanley Interview FAQs

How many rounds are there in Morgan Stanley Software Developer Intern interview?
Morgan Stanley interview process usually has 3 rounds. The most common rounds in the Morgan Stanley interview process are Resume Shortlist, Coding Test and Technical.

Tell us how to improve this page.

Morgan Stanley Software Developer Intern Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Wells Fargo Interview Questions
3.8
 • 580 Interviews
Citicorp Interview Questions
3.7
 • 573 Interviews
HSBC Group Interview Questions
3.9
 • 489 Interviews
American Express Interview Questions
4.1
 • 366 Interviews
BNY Interview Questions
3.8
 • 351 Interviews
UBS Interview Questions
3.9
 • 339 Interviews
FactSet Interview Questions
3.9
 • 208 Interviews
View all
Associate
3.3k salaries
unlock blur

₹5.2 L/yr - ₹21 L/yr

Senior Manager
2.5k salaries
unlock blur

₹16 L/yr - ₹54 L/yr

Manager
2k salaries
unlock blur

₹10.7 L/yr - ₹42 L/yr

Senior Associate
1.6k salaries
unlock blur

₹7.1 L/yr - ₹27 L/yr

Vice President
1.3k salaries
unlock blur

₹21 L/yr - ₹80 L/yr

Explore more salaries
Compare Morgan Stanley with

JPMorgan Chase & Co.

3.9
Compare

Goldman Sachs

3.5
Compare

TCS

3.7
Compare

Deloitte

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview