Filter interviews by
Morgan Stanley is a top-tier investment bank with a strong reputation for innovation and excellence.
Morgan Stanley has a long history of success in the financial industry
The company is known for its innovative approach to investment banking
Morgan Stanley has a strong reputation for excellence in research and analysis
The firm offers a wide range of services to clients, including wealth management and investment banking
M...
Tower and Morgan Stanley are both financial services companies.
Tower is a global investment management firm with over $1 trillion in assets under management.
Morgan Stanley is a multinational investment bank and financial services company.
Both companies offer a range of financial services including wealth management, investment banking, and asset management.
Tower is known for its focus on sustainable investing, while Mo...
The job profile offered is for an analyst position. A PhD is not required for this role.
The job involves analyzing data and providing insights to clients
A PhD is not necessary as the role focuses more on practical application of analytical skills
The job may require a bachelor's or master's degree in a related field
Examples of job responsibilities may include data collection, statistical analysis, and report writing
Innovations to minimize cost of pen
Use recycled materials for pen body and ink
Simplify design to reduce production costs
Implement refillable ink cartridges to reduce waste and cost
Partner with companies for bulk purchasing of materials
Automate production process to reduce labor costs
Prove N>=N^.5+N^(1/3)+N^(1/4) for N>=a
Use AM-GM inequality
Substitute N with a and prove the inequality holds
Use calculus to find the minimum value of the expression
Finding the probability distribution for the minimum of two random variables with given distributions.
Use the formula P(min(x,y)>z) = P(x>z)P(y>z)
Integrate over the range of z to get the distribution of min(x,y)
Final distribution is 2ke^(-kx)ue^(-ux)exp(-uz)
Given prob. p of dying out and prob. (1-p) of spawning into 2, find prob. of dying out starting from 1 organism.
Use probability tree to visualize outcomes
Probability of dying out starting from 1 is p + (1-p) * (probability of dying out starting from 2)^2
Solve recursively to get final answer
Probability of a rectangle being inside a unit circle with p chosen uniformly on the circle and q inside the circle.
The probability can be found by calculating the ratio of the area of the rectangle to the area of the circle.
The area of the circle is pi and the area of the rectangle can be found using the distance between p and q.
The probability is 1/4.
Example: If the distance between p and q is 0.5, then the area of t...
Find local minima of an array in o(log n) in functional programming.
Use binary search to find the local minima.
Check if the mid element is a local minima, if not, move towards the lower side.
If the mid element is greater than its left element, move towards the left side, else move towards the right side.
Repeat until a local minima is found.
Example: [5, 3, 2, 4, 6, 8, 9] -> local minima is 2.
Code to sort a list without pipes
Use a sorting algorithm like bubble sort, insertion sort, or selection sort
Implement the algorithm in the programming language of your choice
Test the code with different input sizes and types
To find an even length palindrome in a string in O(n), we can use the two-pointer approach.
Initialize two pointers at the center of the string.
Expand the pointers outwards while checking if the characters at both pointers are equal.
If they are not equal, return the previous substring as the even length palindrome.
If the pointers reach the end of the string, return the entire string as the even length palindrome.
Possible values of determinant of matrix A given Avi=Vj for n linear vectors
The possible values of |A| are non-zero as the given vectors are linearly independent
The value of |A| can be calculated using the formula |A| = (-1)^n * det(A)
If the given vectors are orthogonal, then |A| is the product of the magnitudes of the vectors
A and B play a game with unfair coin. A wins if # of heads > #tails +1 at any point. Find prob. of A winning.
The game is played with an unfair coin with P[Heads]=p
A wins if # of heads > #tails +1 at any point
Find the probability of A winning
Find two elements in a sorted array that add up to a given sum in linear time.
Use two pointers, one at the beginning and one at the end of the array.
If the sum of the two pointers is greater than the target, move the right pointer to the left.
If the sum of the two pointers is less than the target, move the left pointer to the right.
Repeat until the sum is found or the pointers meet.
Example: Given [1, 2, 3, 4, 5] and ta
The probability of element at 20th position landing up at 31st position after the first iteration.
The probability depends on the size of the dataset and the algorithm used for iteration.
If the algorithm involves swapping adjacent elements, the probability is higher.
If the dataset is sorted in a way that the element at 20th position is adjacent to the element at 31st position, the probability is 1.
The probability can be...
Expected number of collisions between randomly moving ants on a rod after 30 seconds.
Calculate the probability of two ants colliding at any given time.
Use the formula for expected value to find the expected number of collisions.
Assume that the ants are point masses and collisions are perfectly elastic.
Consider the possibility of multiple ants colliding at the same time.
Simulation can also be used to estimate the expect
Counting permutations where numbers between u and i+1 are less than i for all i in the permutation.
The first number in the permutation must be 1.
For each i in the permutation, all numbers between u and i+1 must be less than i.
Use dynamic programming to count the number of valid permutations.
The answer is (n-1)th Catalan number.
Example: for n=4, the answer is 5.
Finding f(n) for a normal standard distribution with a given constant k.
Calculate the product of probability density function and cumulative distribution function.
Integrate the product of f(x) and F(kx) from -inf to +inf.
The value of k is a constant greater than 0.
Number of inversions in an array in O(nlogn) time.
Use merge sort algorithm to count inversions
Divide the array into two halves and recursively count inversions
Merge the two halves and count split inversions
Time complexity is O(nlogn)
I applied via Company Website and was interviewed in Dec 2024. There was 1 interview round.
I have a diverse background in finance, with experience in investment banking, corporate finance, and financial analysis.
Started my career as an investment banking analyst at Goldman Sachs
Transitioned to corporate finance role at Microsoft, focusing on financial planning and analysis
Currently working as a financial analyst at a tech startup, responsible for budgeting and forecasting
Seeking new challenges and growth opportunities in a different environment.
Looking for new challenges and opportunities for growth
Interested in exploring different work environments
Seeking a change in career path or industry
Want to enhance skills and knowledge in a different setting
I align with the role through my strong communication skills, attention to detail, and ability to work well in a team.
Strong communication skills: I excel in conveying information clearly and effectively to team members and clients.
Attention to detail: I have a keen eye for spotting errors and ensuring tasks are completed accurately.
Teamwork: I thrive in collaborative environments and enjoy working with others to achie
I applied via Naukri.com and was interviewed in Sep 2024. There were 4 interview rounds.
Implementation of shared and unique pointers in C++ with operator overloading.
Implement a class for shared pointer with reference counting.
Handle assignment by incrementing reference count and decrementing old pointer's count.
Overload -> and * operators to access underlying object.
Use shared pointer in main method by creating instances and passing them around.
For unique pointer, implement a class that transfers ownersh
Design a system with org hierarchy to find all sub-ordinates using array of pointers.
Create a class for each employee with a pointer to their manager
Use an array of pointers to store all employee objects
Traverse the array to find all sub-ordinates of a given employee
Yes, I am ready to shift to Bengaluru for the c++ associate position.
I am excited about the opportunity to work in Bengaluru.
I have researched the city and am comfortable with the relocation.
I am flexible and adaptable to new environments.
I have friends/family in Bengaluru who can support me during the transition.
What people are saying about Morgan Stanley
Medium leetcode question on array list
Morgan Stanley interview questions for popular designations
CDS stands for Credit Default Swap, a financial derivative used to transfer credit risk between parties.
CDS is a type of insurance contract where one party pays a premium to another party in exchange for protection against a credit event, such as default or bankruptcy.
The buyer of a CDS makes periodic payments to the seller, who agrees to compensate the buyer in the event of a credit event on a specified reference asse...
Options strategies involve buying and selling options contracts to achieve specific investment goals.
Buy Call Option: Bullish strategy where investor expects the price of the underlying asset to rise.
Buy Put Option: Bearish strategy where investor expects the price of the underlying asset to fall.
Covered Call: Selling a call option while holding the underlying asset to generate income.
Straddle: Buying both a call and p...
Options strategies involve buying or selling options contracts to achieve specific investment goals.
Some common options strategies include covered calls, protective puts, straddles, and iron condors.
Covered calls involve selling call options on a stock you own to generate income.
Protective puts involve buying put options to protect against a decline in the value of a stock.
Straddles involve buying both a call and a put...
Get interview-ready with Top Morgan Stanley Interview Questions
There were 3 coding questions having LC easy-medium problems.
I was interviewed in Dec 2024.
I have a strong background in accounting, with proven experience in managing financial operations and driving business growth.
Extensive experience in financial analysis and reporting
Proven track record of improving financial processes and efficiency
Strong attention to detail and accuracy in financial data
Excellent communication and interpersonal skills
Ability to work effectively in a team and independently
Question Related to the DP and the Graph
Find the Kth maximum element in an array of strings.
Sort the array in descending order.
Return the element at index K-1.
Coin change problem can be solved using dynamic programming to find the minimum number of coins needed to make a certain amount of change.
Use dynamic programming to build up solutions for smaller subproblems
Start by initializing an array to store the minimum number of coins needed for each amount from 0 to the target amount
Iterate through each coin denomination and update the array with the minimum number of coins need
I applied via Company Website and was interviewed in Sep 2024. There was 1 interview round.
Reverse a string while keeping the position of spaces intact
Split the string into an array of characters
Iterate through the array and reverse the characters while keeping track of space positions
Join the array back into a string
Leet code medium problem related to arrays
Core Java multithreading serialization Treemap indepth working
Design parking lot with multiple in and out gates
Designing Kafka and microservices architecture for scalability and fault tolerance
Use Kafka as a distributed streaming platform to handle large volumes of data
Implement microservices architecture to break down the application into smaller, independent services
Use Kafka Connect to integrate Kafka with microservices for seamless data flow
Leverage Kafka Streams for real-time data processing within microservices
Ensure faul...
Some of the top questions asked at the Morgan Stanley interview -
The duration of Morgan Stanley interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 196 interviews
Interview experience
based on 1.5k reviews
Rating in categories
Bangalore / Bengaluru
2-5 Yrs
₹ 4.5-16 LPA
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