AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Morgan Stanley Software Developer Interview Questions, Process, and Tips
Top Morgan Stanley Software Developer Interview Questions and Answers
- Q1. Sort Big List Dates Problem Statement Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in ...read more
- Q2. Counting Distinct Elements in Every K-Sized Window Given an array ARR of size N and an integer K , determine the number of distinct elements in every K-sized window of t ...read more
- Q3. Find Shortest Path in a Tree Given a tree with 'N' nodes and 'N - 1' distinct edges, along with two nodes 'N1' and 'N2', find and print the shortest path between 'N1' an ...read more
Morgan Stanley Software Developer Interview Experiences
17 interviews found
Anonymous
I was interviewed in Oct 2020.
(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 1 hour 40 minutes.
Environment (Amcat) is user friendly.
Web cam and mic is enabled
- Q1.
Weight Capacity for Shipment in D Days
You are tasked with managing a shipment company that utilizes conveyor belts to transport packages from one port to another. These packages must be shipped within ‘D...
- Ans.
Calculate minimum weight capacity needed to deliver all packages within 'D' days.
Iterate through the array of weights to find the maximum weight
Use binary search to find the minimum weight capacity needed
Check if the total weight loaded each day does not exceed the ship's maximum weight capacity
- Q2.
Counting Distinct Elements in Every K-Sized Window
Given an array
ARRof sizeNand an integerK, determine the number of distinct elements in every K-sized window of the array. A 'K' sized window is defi... - Ans.
Count the number of distinct elements in every K-sized window of an array.
Use a sliding window approach to keep track of distinct elements in each window
Use a hashmap to store the frequency of elements in the current window
Update the hashmap as you slide the window to the right and maintain the count of distinct elements
Return the count of distinct elements for each window
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
Interview stared at 11:00 am and went for 90 min.
Interview was held in zoom
Environment was very much user friendly
- Q1.
Two Sum in a BST Problem Statement
Given a Binary Search Tree (BST) and a target value, determine if there exists a pair of node values in the BST whose sum equals the target value.
Example:
Input:
4 2... - Ans.
Given a BST and a target value, find if there exists a pair of node values in the BST whose sum equals the target value.
Traverse the BST in-order and store the node values in a set while checking for the target value difference.
Use two pointers approach to find the pair of values that sum up to the target value.
Consider edge cases like negative values and handling duplicates in the BST.
- Q2.
Find Shortest Path in a Tree
Given a tree with 'N' nodes and 'N - 1' distinct edges, along with two nodes 'N1' and 'N2', find and print the shortest path between 'N1' and 'N2'.
Explanation:
A tree is a ...
- Ans.
Find the shortest path between two nodes in a tree.
Use BFS to traverse the tree and find the shortest path between the two nodes.
Maintain a parent array to backtrack from the target node to the source node.
Output the path by backtracking from the target node to the source node using the parent array.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Hr round started at 5:00 pm and went for 60 minutes
It was held on zoom
Interviewer was very much friendly he started with a normal talk to make things light and easy ongoing.
- Q1. Can you tell me about yourself?
- Q2. Why do you want to work at Morgan Stanley?
- Ans.
I want to work at Morgan Stanley because of its reputation for excellence in finance, global presence, and opportunities for growth.
Morgan Stanley is a renowned financial institution known for its excellence in finance
I am attracted to the global presence of Morgan Stanley and the opportunity to work on international projects
I believe working at Morgan Stanley will provide me with opportunities for professional growth
Interview Preparation Tips
Tip 1 : Practice all DSA questions from interview bit
Tip 2 : Do Atleast 3 project one should be major, if it's in web dev it would be beneficial.
Tip 3 : Should be good in communication skills
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
Skills evaluated in this interview
I was interviewed before May 2021.
(1 Question)
Round duration - 45 Minutes
Round difficulty - Hard
- Q1.
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.
(1 Question)
Round duration - 50 Minutes
Round difficulty - Easy
- Q1.
Bubble Sort Problem Statement
Sort an unsorted array of non-negative integers using the Bubble Sort algorithm, which swaps adjacent elements if they are not in the correct order to sort the array in non-d...
- Ans.
Bubble Sort is used to sort an array of non-negative integers in non-decreasing order by swapping adjacent elements if they are not in the correct order.
Iterate through the array and compare adjacent elements, swapping them if they are in the wrong order.
Repeat this process until the array is sorted in non-decreasing order.
Time complexity of Bubble Sort is O(n^2) in worst case.
Example: For input [6, 2, 8, 4, 10], the o
(1 Question)
Round duration - 60 Minutes
Round difficulty - Medium
- Q1.
Unweighted Graph Shortest Path Problem
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has
Nhouses numbered from 1 ... - Ans.
Find the shortest path between two houses in a city represented as an unweighted graph.
Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.
Start BFS from the source house and keep track of the shortest path to each house.
Once the destination house is reached, backtrack to find the shortest path.
Consider using a queue data structure to implement BFS efficiently.
Round duration - 60 Minutes
Round difficulty - Easy
Interview Preparation Tips
Tip 1 : online resources
Tip 2 : cracking the coding interview by Gayle laykemann this is one of the best book for learning the concept at the initial level. Start practicing the approaches mention in the book once done apply the same to similar level pattern questions.
Tip 3 : geeks for geeks start from school level and then move towards easy medium and hard once done practice the previous year questions
Tip 1 : precise clear concise and well written
Tip 2 : mentions the skills sets along with the projects
Skills evaluated in this interview
I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.
Interview Questionnaire
2 Questions
- Q1. Check palindrome , anagram of string with O(n)
- Ans.
To check palindrome and anagram of a string with O(n), use a hash table to store character frequencies.
Create a hash table to store the frequency of each character in the string.
For palindrome, check that no more than one character has an odd frequency.
For anagram, compare the hash tables of the two strings.
If the hash tables are equal, the strings are anagrams.
If the hash tables differ by only one character, the strin...
- Q2. Optimized solutions and core principles applied in OOPS
- Ans.
Optimized solutions and core principles applied in OOPS
Encapsulation, Inheritance, Polymorphism, Abstraction are core principles of OOPS
Optimized solutions can be achieved through efficient algorithms and data structures
Design patterns like Singleton, Factory, Observer can also be used for optimized solutions
Interview Preparation Tips
Skills evaluated in this interview
What people are saying about Morgan Stanley
I was interviewed before Sep 2020.
(1 Question)
Round duration - 90 minutes
Round difficulty - Medium
It was a cumulative test
- Q1.
Trapping Rainwater Problem Statement
You are given an array
ARRof long type, which represents an elevation map whereARR[i]denotes the elevation of theithbar. Calculate the total amount of rainwater t... - Ans.
Calculate the total amount of rainwater that can be trapped within given elevation map.
Iterate through the array to find the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped above each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water above each bar to get the total trapped water for the elevation map.
(1 Question)
Round duration - 90 minutes
Round difficulty - Medium
It was sophisticated in nature and a good brain buster.
- Q1.
Candies Distribution Problem Statement
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...
- Ans.
Determine the minimum number of candies needed to distribute to students based on their performance and ratings.
Iterate through the array of student ratings and assign 1 candy to each student initially.
Then iterate from left to right and check if the current student's rating is higher than the previous student, if so, assign candies accordingly.
Similarly, iterate from right to left to handle cases where the current stu...
(1 Question)
Round duration - 1 hour
Round difficulty - Medium
- Q1. DBMS
It revolved around basic concepts
- Ans.
DBMS is a software system that manages databases and allows users to interact with data stored in them.
DBMS stands for Database Management System
It helps in creating, updating, and managing databases
Examples of DBMS include MySQL, Oracle, SQL Server
It ensures data integrity, security, and efficient retrieval
Round duration - 70 minutes
Round difficulty - Hard
It was a great experience
Interview Preparation Tips
Tip 1 : Stay consistent with your efforts
Tip 2 : Work hard with honesty
Tip 3 : Try to set goal of +1 level from the goal you want to achieve
Tip 1 : Present yourself with honesty
Tip 2 : Mention about the Workshops, hackathons, achievements, and the projects.
Skills evaluated in this interview
Morgan Stanley interview questions for designations
I was interviewed before Mar 2021.
(3 Questions)
Round duration - 90 minutes
Round difficulty - Medium
There were 33 questions in total. The objective questions were simple.
- Q1.
Sort Big List Dates Problem Statement
Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.
Example:
Inpu...
- Ans.
Sort a list of event dates in ascending order based on year, month, and day.
Sort the list of dates based on year, then month, and finally day.
Use a sorting algorithm to rearrange the dates in ascending order.
Ensure the constraints are met for each date in the list.
- Q2.
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.
Given an array and a target sum, find all pairs of elements that add up to the target sum.
Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the pairs based on the first element and then the second element.
Handle edge cases like duplicate elements and pairs with the same values.
Example...
- Q3.
Maximum Sum Problem Statement
Given an integer
N, your task is to recursively break it into three integer parts:N / 2,N / 3, andN / 4. You need to compute the maximum sum possible by dividing the numbe... - Ans.
Given an integer N, recursively break it into three parts and find the maximum sum possible.
Recursively divide N into N/2, N/3, and N/4 to find the maximum sum
Compare the sum obtained by dividing N with the sum of N itself
Return the maximum sum for each test case
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more
Skills evaluated in this interview
Get interview-ready with Top Morgan Stanley Interview Questions
I was interviewed before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions based on DSA.
- Q1.
Duplicate Integer in Array
Given an array
ARRof sizeN, containing each number between 1 andN-1at least once, identify the single integer that appears twice.Input:
The first line contains an integer... - Ans.
Identify the duplicate integer in an array containing numbers between 1 and N-1.
Iterate through the array and keep track of the frequency of each element using a hashmap.
Return the element with a frequency greater than 1 as the duplicate integer.
Ensure the constraints are met and a duplicate number is guaranteed to be present.
- Q2.
Sum Root to Leaf Numbers
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
- Ans.
Calculate the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current node value to the path sum and multiply by 10 for each level
When reaching a leaf node, add the final path sum to the total sum
Return the total sum modulo (10^9 + 7)
- Q3.
Topological Sort Problem Statement
You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.
Explanation:
A directed acyclic g...
- Ans.
Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.
Create a graph data structure to represent the DAG
Use depth-first search (DFS) to perform topological sorting
Maintain a visited array to keep track of visited nodes
Return the ordering of nodes after DFS traversal
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round with questions based on DSA.
- Q1.
LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes,
XandY. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes... - Ans.
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other.
Consider edge cases like when X or Y is the root node.
Implement a recursive or iterative solution to find the LCA efficiently.
- Q2.
Rotated Array Minimum Finder
You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...
- Ans.
Implement a function to find the minimum number in a rotated sorted array efficiently.
Use binary search to find the minimum element in the rotated array.
Compare the mid element with the start and end elements to determine which half of the array to search next.
Continue the binary search until the minimum element is found.
- Q3.
Maximum Binary Tree Construction Problem
Given an array
TREEof 'N' unique integers, construct a maximum binary tree using the following rules:- The root of this tree is the maximum number in
TREE. - T...
- The root of this tree is the maximum number in
- Ans.
Construct a maximum binary tree from an array of unique integers following specific rules.
Find the maximum number in the array to set as the root of the tree.
Recursively construct the left subtree with elements before the maximum number.
Recursively construct the right subtree with elements after the maximum number.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Preparation Tips
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5
- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.
College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]
Morgan Stanley Interview FAQs
Some of the top questions asked at the Morgan Stanley Software Developer interview -
Tell us how to improve this page.
Morgan Stanley Interviews By Designations
- Morgan Stanley Associate Interview Questions
- Morgan Stanley Senior Manager Interview Questions
- Morgan Stanley Analyst Interview Questions
- Morgan Stanley Software Developer Interview Questions
- Morgan Stanley Manager Interview Questions
- Morgan Stanley Senior Associate Interview Questions
- Morgan Stanley Director Interview Questions
- Morgan Stanley Senior Software Engineer Interview Questions
- Show more
Morgan Stanley Software Developer Interview Process
based on 7 interviews
2 Interview rounds
- Coding Test Round
- Technical Round
Top Skills for Morgan Stanley Software Developer
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Morgan Stanley Software Developer Reviews and Ratings
based on 23 reviews
Rating in categories
|
Associate
3.1k
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Senior Manager
2.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Manager
1.9k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Associate
1.6k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Vice President
1.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
JPMorgan Chase & Co.
Goldman Sachs
TCS
Deloitte
- Home >
- Interviews >
- Morgan Stanley Interview Questions >
- Morgan Stanley Software Developer Interview Questions
