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 and Answers for Freshers

Updated 21 Dec 2023

8 Interview questions

A Software Developer Intern was asked
Q. 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...

A Software Developer Intern was asked
Q. 

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

Software Developer Intern Interview Questions Asked at Other Companies for Fresher

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
A Software Developer Intern was asked
Q. 

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

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

A Software Developer Intern was asked
Q. 

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

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.

🔥 Asked by recruiter 2 times
A Software Developer Intern was asked
Q. 

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

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.

A Software Developer Intern was asked
Q. 

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

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.

A Software Developer Intern was asked
Q. 

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.

Are these interview questions helpful?
A Software Developer Intern was asked
Q. 

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

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

Morgan Stanley Software Developer Intern Interview Experiences for Freshers

3 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

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

Top trending discussions

View All
Interview Tips & Stories
2w
toobluntforu
·
works at
Cvent
Can speak English, can’t deliver in interviews
I feel like I can't speak fluently during interviews. I do know english well and use it daily to communicate, but the moment I'm in an interview, I just get stuck. since it's not my first language, I struggle to express what I actually feel. I know the answer in my head, but I just can’t deliver it properly at that moment. Please guide me
Got a question about Morgan Stanley?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

It was in the day time. I was asked the programming language of my choice. It was mostly focused on programming fundamentals. I was asked 2 questions based on Data Structures and Algorithms.

  • Q1. How can you detect a loop in a linked list?
  • Ans. 

    A loop in a linked list can be detected using Floyd's Cycle Detection Algorithm.

    • Use two pointers - slow and fast, where slow moves one step at a time and fast moves two steps at a time.

    • If there is a loop, the two pointers will eventually meet at some point within the loop.

    • To detect the start of the loop, reset one pointer to the head and move both pointers one step at a time until they meet again.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

This round was mostly focused on my resume and projects.

  • Q1. Tell me about your projects.
Round 3 - Face to Face 

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening. I went to their office in Gurgaon. It was taken by one of the technology director who had a lot of experience. 
 

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Bharati Vidyapeeth's College of Engineering. I applied for the job as SDE - 1 in GurgaonAmerican Express interview preparation:Topics to prepare for the interview - Data structures and algorithms, Object-Oriented Programming System concepts, Database Management System, Operating System, Networking.Time required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Do practice a lot of data structures questions as mostly questions in interviews are based on them. Also, do prepare for projects mentioned in your resume and skills which you have mentioned. Coding ninjas has a big hand in making my interview clear as I have taken a course from the coding Ninjas which helped me a lot to make my concepts clear.

Application resume tips for other job seekers

Keep it short and crisp. Go through it properly before the interview. Make sure that you haven't put anything in it that can cause you problems during the interview.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Nov 2021. 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 - Aptitude Test 

Moderate level aptitude with basics

Round 3 - Coding Test 

Moderate level data structure questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and what what u speak because that is most important

I appeared for an interview in May 2017.

Interview Questionnaire 

6 Questions

  • Q1. Can string class be extended
  • Ans. 

    Yes, the string class can be extended in most programming languages.

    • Inheritance can be used to extend the functionality of the string class.

    • By creating a new class that inherits from the string class, additional methods and properties can be added.

    • Extending the string class allows for customization and adding specific functionality to strings.

    • Example: In Python, the string class can be extended by creating a new class ...

  • Answered by AI
  • Q2. What are the implecit object in JSP
  • Ans. 

    Implicit objects in JSP are predefined objects that are available for use without any declaration or initialization.

    • Implicit objects in JSP include request, response, session, application, out, config, pageContext, page, exception, and others.

    • These objects provide access to various aspects of the JSP environment and can be used to perform common tasks.

    • For example, the request object allows access to HTTP request parame...

  • Answered by AI
  • Q3. How does hash map works
  • Ans. 

    A hash map is a data structure that uses a hash function to map keys to values.

    • Hash map stores key-value pairs

    • It uses a hash function to compute an index for each key

    • Collisions can occur when two keys hash to the same index

    • Hash maps provide fast access to values based on their keys

  • Answered by AI
  • Q4. Difference between string buffer and string builder
  • Ans. 

    StringBuffer and StringBuilder are both used to manipulate strings, but StringBuffer is thread-safe while StringBuilder is not.

    • StringBuffer is synchronized, making it safe for use in multi-threaded environments.

    • StringBuilder is not synchronized, making it faster but not thread-safe.

    • StringBuffer is preferred when multiple threads are involved, while StringBuilder is preferred for single-threaded scenarios.

    • Both classes p...

  • Answered by AI
  • Q5. What is MVC
  • Ans. 

    MVC is a software architectural pattern that separates an application into three main components: Model, View, and Controller.

    • Model represents the data and business logic of the application.

    • View is responsible for displaying the user interface.

    • Controller handles user input, updates the model, and interacts with the view.

    • MVC promotes separation of concerns and modularity in software development.

    • Example: In a web applica...

  • Answered by AI
  • Q6. What are the annotation used in RESTFULL web services
  • Ans. 

    Annotations used in RESTful web services

    • 1. @Path - Specifies the URI path for the resource

    • 2. @GET - Specifies that the method handles HTTP GET requests

    • 3. @POST - Specifies that the method handles HTTP POST requests

    • 4. @PUT - Specifies that the method handles HTTP PUT requests

    • 5. @DELETE - Specifies that the method handles HTTP DELETE requests

    • 6. @PathParam - Binds the value of a URI template parameter to a method paramete...

  • Answered by AI

Interview Preparation Tips

Skills: Java Application Development

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Asked many Dbsa questions. You need to be thorough about the joins in the databases.

Interview Preparation Tips

Round: Test
Experience: Practice questions on Indiabix.

Round: Technical Interview
Experience: Operating Systems basics, Dbsa basics

General Tips: 1: Be Confident.
2: Keep Smiling.
3: Do not be Panic.
4: Remember they are here to hire you but not reject you.
5: Do not loose hope.
6: Believe at yourself.
7: Start preparing early.
8: Do demo interviews with your friend.
Skill Tips: Make sure you do a course on object oriented programming
Skills: C, Sql, Java
College Name: BITS PILANI
Motivation: Every body joins a comapny for making a software or earning money. But I was always motivated to MAKE MONEY. I have taken this job because they have very extensive work in Share Market and they have lots of MBA from IIM's, Lots of CAs, CS. Thats why i have choosen Edelweiss. I have rejected epic System USA for this profile.
Are these interview questions helpful?

Interview Preparation Tips

Round: Test
Experience: The written test was quite similar to the typical CAT pattern. It contained sections on Reading Comprehension, Data Interpretation and Mathematics.

Round: Technical + HR Interview
Experience: There were 2 interviewers in the first interview, one was a technical guy and the other was from HR. They asked me a few very simple puzzles, a few basic programming questions (swapping the value of two variables etc.), questions related to the development cycle of software products. The HR guy asked stuff like what do you want to achieve in life? Strengths, weaknesses etc.

Round: Case Study Interview
Experience: The third interview was the most important one (and I guess that was the deciding interview). The interviewer started with questions like why finance? Which companies are you sitting for? Then he gave me a case study:

Interview Questionnaire 

2 Questions

  • Q1. Oops, os, dbms, project
  • Q2. Why hsbc, why should I hire you.
  • Ans. 

    I have a strong background in software engineering and a passion for innovation, making me a valuable asset to HSBC.

    • I have a proven track record of successfully delivering high-quality software solutions in previous roles.

    • I am highly skilled in various programming languages and technologies, including Java, Python, and SQL.

    • I have experience working in agile development environments, allowing me to adapt quickly to chan...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: 4 sections, 15 questions each. Sections on apti, english, programming, technical.
Tips: Time management, complete english and technical first
Duration: 1 hour
Total Questions: 60

Round: Group Discussion
Experience: We were asked which super hero would you like to be. Shared the information. Always present the positives and negatives and emphasize that despite of being negatives
Tips: Think everything through before speaking
Duration: 40 minutes

Round: Technical Interview
Experience: Prepare well, anything can be asked on the things written on your resume

Round: HR Interview
Experience: Sell yourself. Tell them why you would be the best candidate.
Tips: Tell your advantages of being a fresher that you would be comfortable in any technology

College Name: Acropolis institute of technology and research

Interview Preparation Tips

Round: Test
Experience: The test was for two and half hours where 1 hour was for general aptitude, 1 hr was for coding aptitude(either on java or C or C++as you choose) and 1/2 an hour for two coding questions.

Round: Technical Interview
Experience: In technical round they asked puzzles, aptitude questions and basic C coding. I was asked to write the code for two questions(one was on sort and search) and was asked the logic of two questions.They asked basics of linked lists, stacks, queues. Infact they were not very interested in the syntax and were pressing on the logic

General Tips: Being a non software branch students is not at all a problem. The company took 4 interns where 3 were from core branches. The fact that we had to work in JAVA and most of us didn't know JAVA, the company only looks for aptitude and ability to learn. So if you don't know anything, tell frankly that you don't know that part, rather than guessing. Be thorough with what you know and confidentially answer all the questions.
Also do not be tensed and take things lightly, if the interviewer is joking. Be candid.
Skill Tips: Learn basics of coding from books . Aptitude can be done from sites likes geeks for geeks, etc. The level of aptitude is not very high and infact the coding aptitude is also theoretical and does not involve in depth knowledge.
Skills:
College Name: NIT Surathkal

Morgan Stanley Interview FAQs

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

Tell us how to improve this page.

Overall Interview Experience Rating

4/5

based on 1 interview experience

Difficulty level

Hard 100%

Duration

2-4 weeks 100%
View more

Interview Questions from Similar Companies

Wells Fargo Interview Questions
3.8
 • 615 Interviews
Citicorp Interview Questions
3.7
 • 587 Interviews
HSBC Group Interview Questions
3.9
 • 510 Interviews
American Express Interview Questions
4.1
 • 386 Interviews
BNY Interview Questions
3.8
 • 366 Interviews
UBS Interview Questions
3.9
 • 351 Interviews
View all
Associate
3.5k salaries
unlock blur

₹10 L/yr - ₹17 L/yr

Senior Manager
2.5k salaries
unlock blur

₹26.1 L/yr - ₹47.3 L/yr

Manager
1.9k salaries
unlock blur

₹17.8 L/yr - ₹32.4 L/yr

Senior Associate
1.7k salaries
unlock blur

₹12.8 L/yr - ₹22 L/yr

Vice President
1.4k salaries
unlock blur

₹38.8 L/yr - ₹71.2 L/yr

Explore more salaries
Compare Morgan Stanley with

JPMorgan Chase & Co.

3.9
Compare

Goldman Sachs

3.5
Compare

TCS

3.6
Compare

Deloitte

3.7
Compare
write
Share an Interview