Filter interviews by
I applied via Referral and was interviewed in Jun 2023. There were 3 interview rounds.
3 questions of medium to hard coding questions.
I appeared for an interview in Nov 2020.
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.
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.
The first...
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.
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...
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.
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.
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...
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
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...
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.
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.
Tip 1 : practice on gfg and coding ninjas
Tip 2 : compete on codechef and codeforces
Tip 3 : learn DSA and practice regularly
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
I appeared for an interview in Nov 2020.
Round duration - 90 Minutes
Round difficulty - Hard
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...
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...
Round duration - 90 Miinutes
Round difficulty - Medium
I was asked 3 coding questions
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...
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...
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...
Round duration - 60 Minutes
Round difficulty - Easy
This is HR + Technical Round
Started with tell me about yourself asked about projects in depth
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 ...
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.
Tip 1 : Be good with aptitube skills
Tip 2 : Good with data structures and algorithms
Tip 3 : Be confident while explaining
Tip 1 : Good Projects
Tip 2 : Achievement is good to have
What people are saying about Morgan Stanley
I appeared for an interview in Nov 2020.
Round duration - 50 minutes
Round difficulty - Hard
Timing (10 am- 10:50 am)
For this round I had slightly more time than the last, due to the fact that the weekend fell in between.The interviewer was very very cool and helping this time, something which I kept at the last in my list of probable things that can happen during an interview. Duration of this round was around 50 minutes.
This time I had to face three technical questions and one general question on Finance banks.
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'.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the result list based on the criteria mentioned in the problem statement.
Given a binary tree with N
nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true
; otherwise, return false
.
A binary search tree (BST)...
Validate if a binary tree is a Binary Search Tree (BST) or not.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Check if the right subtree of a node contains only nodes with data greater than the node's data.
Ensure both the left and right subtrees are also binary search trees.
Traverse the tree in an inorder manner and check if the elements are in sorted order.
Recursively valid...
Round duration - 35 minutes
Round difficulty - Medium
There was only one interviewer for this round. He continuously interacted with me and was giving me some good situational problems that were not very easy to answer. Basically those were open-minded questions which can be answered oth ways and that's why I found it quiet hard as per my nature but at the end things went well for me.
Tip 1 : Practice on gfg and coding ninjas.
Tip 2 : Compete on codechef and codeforces.
Tip 3 : Learn DSA and practice regularly.
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
Morgan Stanley interview questions for designations
I appeared for an interview before Oct 2020.
Round duration - 180 Minutes
Round difficulty - Hard
There will be 4 programming questions( 3 medium, 1 hard)
Participants can attempt as many questions as they can within the test duration. The more the number of questions they attempt and get correct, the better their chances of getting shortlisted for interviews.
It was camera monitored. Don't change the tab while attempting the test.
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...
The task is to find 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.
The final answer will be the number of ways to make change for the target...
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
The problem involves finding the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.
Use dynamic programming to solve the problem efficiently.
The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.
Handle base cases for N=0 and N=1 separately.
Consider using modulo operation to avoid overflow when dealing with large numbers.
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...Merge two sorted linked lists into a single sorted linked list without using additional space.
Create a dummy node to start the merged list
Compare the values of the two linked lists and add the smaller value to the merged list
Move the pointer of the merged list and the respective linked list with the smaller value
Continue this process until one of the linked lists is fully traversed
Append the remaining elements of the o
Given a pattern as a string and a set of words, determine if the pattern and the words list align in the same sequence.
T (number of test cases)
For each test ca...
Given a pattern and a list of words, determine if the words align with the pattern.
Iterate through the pattern and words simultaneously to check for alignment.
Use a hashmap to store the mapping between characters in the pattern and words.
Return 'True' if the words match the pattern sequence, else return 'False'.
Round duration - 75 Minutes
Round difficulty - Easy
This round was held online over Webex and CodePair (a screen-sharing code editor ).
The interviewer made it clear in the beginning that he wanted to know me as a person, what my interests are, and how well I am as a problem solver. The interview started with my introduction, my interests, coding languages I am comfortable with, my previous internship experiences, and my projects. He then asked some questions about OOPS and data structures. After judging my problem-solving skills and thought process from previous questions, he gave me 2 coding questions to solve. I was able to solve both of them.
You are given an array 'ARR'
of size 'N'
consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in t...
The minimum operations problem involves finding the minimum number of operations required to make all elements in an array equal.
Iterate through the array to find the maximum and minimum values.
Calculate the difference between the maximum and minimum values.
The minimum number of operations needed is the difference between the maximum and minimum values.
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 ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Use Floyd's Tortoise and Hare algorithm to detect a cycle in the linked list.
Initialize two pointers, slow and fast, and move them at different speeds through the list.
If there is a cycle, the fast pointer will eventually meet the slow pointer.
If the fast pointer reaches the end of the list (null), there is no cycle
Tip 1 : The interviewer will not only look at your technical skills but also your team building and leadership qualities
Tip 2 : It's okay if you don't have an optimal solution in one go. Try to break the problem and don't give up.
Tip 3 : Practice at least 150 Questions on Leetcode covering all topics. Chances of asking tough topics like DP, greedy are less.
Tip 4 : Make sure you have at least 1 project to discuss in depth. Be prepared with all challenges you had while doing the project and how you overcome them.
Tip 5 : If you ever participated in/organized a hackathon/college event, make sure you highlight that. This will make you shine from the rest of the candidates.
Tip 6 : The interviewer might also give you a couple of leadership/team-based scenarios and what will you do in that situation.
Tip 7 : Lastly make sure to read about BNY Mellon and what it do.
Tip 1 : Try to add Experience at the top with a detailed explanation of work done by you
Tip 2 : If No projects and Experience: Try to add Coding profiles, Achievements (Hackathons and Coding Competitions )
Tip 3 : Make sure to highlight any competition/hackathon that you won.
I applied via LinkedIn and was interviewed in Feb 2021. There was 1 interview round.
I appeared for an interview before Nov 2020.
Round duration - 90 minutes
Round difficulty - Medium
It was in the evening at about 7 pm. The test platform was quite user friendly and easy to use.
There were 3 sections in test. One was logical ability, second was english, third was coding
Questions were of medium difficulty.
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...
The task is to find the total number of ways to make change for a specified value using given denominations.
Use dynamic programming to solve this problem efficiently.
Create a 1D array to store the number of ways to make change for each value from 0 to the target value.
Iterate through the denominations and update the array based on the current denomination.
The final answer will be the value at the target index of the ar
Round duration - 30 Minutes
Round difficulty - Medium
It was a 30 minute interview. In which I was provided with questions on data structures and algorithms to check my problem solving skills.
Given an integer array ARR
of size N
, determine if it can be transformed into a non-decreasing array by modifying at most one element.
An array is defined as non-de...
Determine if an array can be transformed into a non-decreasing array by modifying at most one element.
Iterate through the array and check if there are more than one decreasing elements.
If there is only one decreasing element, check if modifying it can make the array non-decreasing.
Return true if the array can be made non-decreasing by modifying at most one element, otherwise false.
Round duration - 40 Minutes
Round difficulty - Medium
In this round , interviewer discussed about my resume. As I had done a internship in sql and database so he asked me questions related to dbms and sql queries.
Tip 1 : practice data structures and algorithms thoroughly
Tip 2 : do atleast 2 project
Tip 3 : maintain a decent cgpa (above 8.5)
Tip 1 : write all your academic achievements on resume
Tip 2 : do not write false things in resume
Tip 3 : be thorough with your resume
I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 4 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Mar 2021. There was 1 interview round.
based on 1 interview
Interview experience
Associate
3.3k
salaries
| ₹5.2 L/yr - ₹21 L/yr |
Senior Manager
2.5k
salaries
| ₹16 L/yr - ₹54 L/yr |
Manager
2k
salaries
| ₹10.7 L/yr - ₹42 L/yr |
Senior Associate
1.6k
salaries
| ₹7.1 L/yr - ₹27 L/yr |
Vice President
1.3k
salaries
| ₹21 L/yr - ₹80 L/yr |
JPMorgan Chase & Co.
Goldman Sachs
TCS
Deloitte