Morgan Stanley Digital Technology Intern Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Medium

This round started with my introduction and a brief discussion on the technologies I used in my project. After this, the interviewer asked me 3 coding questions and one low-level design question.

Q1. 
Find the Second Largest Element
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
Example:
Input:
ARR = [2,...read more
Ans. 
I traversed the array twice. In the first traversal, I found the maximum element. In the second traversal I found the greatest element less than the element obtained in the first traversal.
Answered Anonymously
Add your answer
Q2. 
Minimum Number of Platforms Problem
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Explanation:
Given two arrays:
• AT - represent...read more
Ans. 
I took a variable to count the number of platforms required at a particular time and a final ans variable. I took 2 arrays one for arrival time and the other for departure time and sorted both the arrays. Then I took 2 pointers at the start of each array and compared the timings pointed by the 2 variables. If the smallest time was of arrival I incremented my count variable otherwise decremented it and incremented the p...read more
Answered Anonymously
Add your answer
Q3. 
Boundary Traversal of a Binary Tree
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
Input:
The first line ...read more
Ans. 
First I printed the left-most boundary of the tree, then I printed all the leafs of the tree, and then the rightmost boundary in reverse order using recursion.
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

This Round was a Technical + HR round which consisted of one coding question and some general HR Questions like what are your strengths and weeknesses and why do you want to join Morgan Stanley.

Q1. 
Next Greater Number Problem Statement
Given a string S which represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequenc...read more
Ans. Greedy Implementation
• First of all, we shall consider some base cases before moving on to the actual solution.
  • If all the digits are sorted in ascending order, then just swap the last two digits, and return them, since it will give us the next greater number.
  • If all the digits are sorted in descending order, then return -1, since we will not have any greater number than the given number which may contain the same set of d...read more
Answered Anonymously
Add your answer