Morgan Stanley Interview Questions, Process, and Tips

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...read more
Ans. 
Use the array indexes as storage and apply module operation to find the repertitive no
Answered Anonymously
Add your answer

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...read more
Ans. 
Use pass technique to solve the problem
Answered Anonymously
Add your answer

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 N houses numbered from 1 ...read more
Ans. BFS
• Store all the edges in the form of an adjacency list ADJ. if ADJ[X][j] = Y which means there is an edge from X to Y.
• Declare a queue Q and push S in it and also declare two vectors VISITED and DISTANCE which will store whether a house is visited or not and what is a distance of the house from house S respectively.
• We will also store the PARENT, that store the node from which we will reach the current node. It will hel...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy