Filter interviews by
There were 3 coding questions having LC easy-medium problems.
I appeared for an interview in May 2022.
Round duration - 90 Minutes
Round difficulty - Medium
The round was conducted early in the morning.There were 3 sections:
1.Aptitude based on Maths and Logic
2.Questions based of core subjects and basic Data Structures
3.Coding Round -2 questions
In a directed acyclic graph with 'N' nodes, given a matrix 'edges' of size M x 2 representing 'M' edges where each edge is directed from nod...
The problem involves finding the smallest set of vertices from which all nodes in a directed acyclic graph are reachable.
Create a directed graph using the given edges.
Perform a topological sort to find the vertices that can reach all other nodes.
Output the smallest set of vertices in sorted order.
Consider you are provided with 'n' different types of rectangular 3D boxes. For each type of box, you have three separate arrays: height
, width
, and length
that define the d...
The task is to stack different types of rectangular 3D boxes to achieve the maximum possible height by following certain constraints.
Sort the boxes based on their base dimensions in non-increasing order.
Use dynamic programming to find the maximum height achievable by stacking the boxes.
Consider all possible rotations of each box to maximize the height.
Ensure that the base dimensions of the boxes below are strictly larg...
Round duration - 90 Minutes
Round difficulty - Medium
A face to face interview was scheduled with the interviewer.I was asked to solve a few coding questions and then asked questions based on OS and OOPS and some questions related to the working of my projects.
Given an integer array ARR
of size N
containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...
Implement a function to sort an array of 0s and 1s in linear time complexity without using additional arrays.
Iterate through the array and maintain two pointers, one for 0s and one for 1s.
Swap elements at the two pointers to sort the array in place.
Time complexity should be O(N) where N is the size of the array.
You are given a linked list with 'N' nodes, where each node contains two pointers: one is 'NEXT' pointing to the next node in the list, and the other is 'CHILD', po...
Flatten a multilevel sorted linked list while maintaining sorted order.
Iterate through the linked list nodes and maintain a stack to keep track of child nodes.
Merge the child nodes with the parent node in sorted order.
Update the pointers to create a single level flattened linked list.
Round duration - 40 Minutes
Round difficulty - Easy
I was asked basic HR questions and some questions based on my resume.
Tip 1 : Don't focus on the number of questions but on the concepts and quality.
Tip 2 : Do at least 2 projects.
Tip 3 : Go through the previously asked questions of the company you are applying for.
Tip 1 : The projects you do should be explained in a concise manner. Keep the resume short and crisp while delivering all the important details.
Tip 2 : Highlight the unique points.
What people are saying about Morgan Stanley
Morgan Stanley interview questions for designations
Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Bubble Sort works by repeatedly swapping adjacent elements if they are in the wrong order.
It is called Bubble Sort because smaller elements 'bubble' to the top of the list.
The algorithm continues until the entire list is sorted.
Bubble Sort has a time complexity of O(...
A program to convert a given number into words.
Create a function that takes a number as input
Use conditional statements to check the number's value and convert it into words
Break down the number into its individual digits and convert each digit into words
Combine the words for each digit to form the final word representation of the number
Strengths: Analytical thinking, attention to detail, quick learner. Weaknesses: Impatience, perfectionism, public speaking.
Strengths: Analytical thinking - able to break down complex problems, attention to detail - ensures accuracy in work, quick learner - able to adapt to new technologies quickly
Weaknesses: Impatience - may rush through tasks, perfectionism - may spend too much time on minor details, public speaking -...
Get interview-ready with Top Morgan Stanley Interview Questions
Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Bubble Sort compares adjacent elements and swaps them if they are in the wrong order.
It continues this process until the entire list is sorted.
It is called Bubble Sort because smaller elements 'bubble' to the top of the list.
Bubble Sort has a time complexity of O(n^2...
A program to convert a given number into words.
Use a switch statement or if-else conditions to handle different cases
Break down the number into its individual digits and convert each digit into words
Handle special cases like numbers between 10 and 20
Consider adding a function to handle larger numbers with appropriate suffixes
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on DSA and OOPS.
An AVL tree is a self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one.
AVL trees are named after their inventors Adelson-Velsky and Landis.
They are used to maintain sorted data and ensure efficient search, insertion, and deletion operations.
Balancing in AVL trees is achieved through rotations to maintain the height balance factor.
Example: Inserting elements 1, 2...
Binary Search halves the search space in each iteration, leading to a time complexity of O(Log n).
Binary Search divides the array into two halves and compares the target value with the middle element.
If the target value is less than the middle element, it searches in the left half; otherwise, it searches in the right half.
This process continues until the target value is found or the subarray size becomes 0.
Since each c...
Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...
Implement a priority queue using a heap data structure by completing the provided class functions.
Implement push(), pop(), getMaxElement(), and isEmpty() functions in the given class structure.
Use a heap data structure to maintain the priority queue.
Handle different types of queries (push, pop, getMaxElement, isEmpty) as per the given instructions.
Ensure the functions return the correct values based on the type of quer...
Given an integer 'N', continue summing its digits until the result is a single-digit number. Your task is to determine the final value of 'N' after applying this operation ...
Given an integer, sum its digits until a single-digit number is obtained. Determine the final single-digit integer.
Iteratively sum the digits of the integer until a single-digit number is obtained
Output the final single-digit integer for each test case
Handle multiple test cases efficiently
Ensure the final value is less than 10
HashMap is a collection of key-value pairs, while HashSet is a collection of unique elements.
HashMap allows duplicate values but keys must be unique
HashSet does not allow duplicate elements
HashMap uses key-value pairs for storing data, while HashSet only stores individual elements
Example: HashMap<String, Integer> map = new HashMap<>(); HashSet<String> set = new HashSet<>();
Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.
Abstract class can have constructors, fields, and methods, while interface cannot have any implementation.
A class can only extend one abstract class, but can implement multiple interfaces.
Abstract classes are used to define common characteristics of subclasses, while interfaces are used to define a contract fo...
Virtual destructors are needed to ensure proper cleanup of resources in derived classes when using polymorphism.
Virtual destructors are necessary to ensure that the destructor of the most derived class is called when deleting a base class pointer to a derived class object.
Without virtual destructors, only the base class destructor would be called, leading to memory leaks and resource leaks in the derived class.
Virtual ...
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with questions on OS and OOPS. A design question was also discussed.
Round Robin Algorithm is a CPU scheduling algorithm where each process is assigned a fixed time slice in a cyclic manner.
Each process is given a small unit of time to execute, called a time slice or quantum.
Once a process's time slice expires, it is moved to the end of the ready queue.
The scheduler then moves to the next process in the queue and allocates it the CPU for its time slice.
This continues until all processes...
Design a system for users to subscribe to topics and receive notifications for new messages.
Create a user profile where they can select topics of interest to subscribe to.
Implement a messaging system that sends notifications to users when new messages are posted related to their subscribed topics.
Allow users to manage their subscriptions and preferences easily.
Utilize a database to store user subscriptions and messages...
Memory allocation in recursion involves creating a new stack frame for each recursive call.
Each recursive call creates a new stack frame to store local variables and function parameters.
Memory is allocated on the stack for each stack frame, which can lead to stack overflow if too many recursive calls are made.
Once a recursive call returns, its stack frame is deallocated to free up memory.
Example: Factorial function rec...
Threads are needed to allow a program to perform multiple tasks concurrently, improving performance and responsiveness.
Threads allow for parallel execution of tasks, utilizing multiple CPU cores efficiently.
Threads can improve responsiveness in applications by handling multiple tasks simultaneously.
Threads are essential for implementing features like background processing, multitasking, and handling user input concurre...
Round duration - 45 minutes
Round difficulty - Easy
This was a group activity round.
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
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.
posted on 10 Feb 2017
I appeared for an interview in Sep 2016.
I am a technology enthusiast with a strong background in analyzing and implementing innovative solutions.
Experienced in analyzing technology trends and identifying opportunities for improvement
Skilled in implementing software solutions to enhance business processes
Proficient in data analysis and problem-solving
Strong communication and teamwork skills
Certified in various technology platforms such as AWS and Microsoft Az
SDLC consists of several phases including planning, analysis, design, implementation, testing, deployment, and maintenance.
Planning: Defining project goals, scope, and requirements.
Analysis: Gathering and analyzing user requirements.
Design: Creating a detailed blueprint of the software solution.
Implementation: Writing code and developing the software.
Testing: Conducting various tests to ensure software quality.
Deployme...
I choose your company because of its reputation for innovation and commitment to employee growth.
Reputation for innovation in the technology industry
Commitment to employee growth and development
Positive reviews from current and former employees
Exciting projects and opportunities for career advancement
Before joining the company, I will learn about the company culture, technology stack, project methodologies, and industry trends.
Research the company's culture, values, and work environment
Familiarize myself with the technology stack used by the company
Understand the project methodologies followed by the company
Stay updated on the latest trends and developments in the industry
posted on 27 Aug 2017
I appeared for an interview in Aug 2017.
I am a technology enthusiast with a background in computer science and a passion for analyzing and predicting tech trends.
Background in computer science
Passionate about analyzing tech trends
Keen interest in emerging technologies
Experience in data analysis and research
Strong problem-solving skills
I have worked on various projects including developing mobile applications, implementing cloud solutions, and analyzing data for business insights.
Developed a mobile application for tracking fitness goals using React Native
Implemented a cloud-based CRM system for a small business using Salesforce
Analyzed customer data to identify trends and improve marketing strategies
I plan to pursue a Master's degree in Data Science to enhance my analytical skills and stay updated with the latest technology trends.
Pursue a Master's degree in Data Science
Enhance analytical skills
Stay updated with technology trends
JP Morgan is a leading financial institution with a strong reputation for innovation and technology in the industry.
JP Morgan has a history of investing heavily in technology and innovation.
The company has a strong track record of developing cutting-edge solutions for financial services.
JP Morgan's commitment to technology and digital transformation aligns with my career goals and interests.
posted on 6 Nov 2019
I applied via Referral and was interviewed in May 2019. There were 3 interview rounds.
based on 1 interview
4 Interview rounds
based on 5 reviews
Rating in categories
Associate
3.2k
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