Upload Button Icon Add office photos

Morgan Stanley

Compare button icon Compare button icon Compare

Filter interviews by

Morgan Stanley Technology Analyst Interview Questions, Process, and Tips

Updated 27 Sep 2024

Top Morgan Stanley Technology Analyst Interview Questions and Answers

  • Q1. Sort 0 and 1 Problem Statement 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 t ...read more
  • Q2. Minimum Number of Vertices to Reach All Nodes Problem Statement In a directed acyclic graph with 'N' nodes, given a matrix 'edges' of size M x 2 representing 'M' edges w ...read more
  • Q3. Flatten a Multilevel Sorted Linked List 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 ...read more
View all 17 questions

Morgan Stanley Technology Analyst Interview Experiences

7 interviews found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

There were 3 coding questions having LC easy-medium problems.

Round 2 - Technical 

(2 Questions)

  • Q1. DSA Coding questions from LC
  • Q2. Asked about CS fundamentals - OS, OOPs etc.
Round 3 - Technical 

(2 Questions)

  • Q1. OOPs Design - Low Level Design Round
  • Q2. Follow up questions on the solution

I appeared for an interview in May 2022.

Round 1 - Coding Test 

(2 Questions)

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

  • Q1. 

    Minimum Number of Vertices to Reach All Nodes Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Box Stacking Problem Statement

    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...

  • Ans. 

    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...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

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.

  • Q1. 

    Sort 0 and 1 Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Flatten a Multilevel Sorted Linked List

    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...

  • Ans. 

    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.

  • Answered by AI
Round 3 - HR 

Round duration - 40 Minutes
Round difficulty - Easy

I was asked basic HR questions and some questions based on my resume.
 

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Technology Analyst in BangaloreEligibility criteriaNo crieriaMorgan Stanley interview preparation:Topics to prepare for the interview - Operating System, Object-Oriented Programming (OOPS), Algorithms, Dynamic Programming, Data StructuresTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Technology Analyst Interview Questions Asked at Other Companies

Q1. Sort 0 and 1 Problem Statement Given an integer array ARR of size ... read more
Q2. Minimum Number of Vertices to Reach All Nodes Problem Statement I ... read more
asked in Infosys
Q3. An atomic spark job runs for 15 mins everyday ,one day it is runn ... read more
Q4. Flatten a Multilevel Sorted Linked List You are given a linked li ... read more
Q5. Box Stacking Problem Statement Consider you are provided with 'n' ... read more

Interview Preparation Tips

Round: Test
Experience: Apptitude test (16 shortlisted out of 65) 10 quant + logic 10 data structure , operating systems 30 programming questions (you have option to select c/c++/java)Passing individually in all sections compulsorygood quality of questionskeep concepts well in place

Round: Technical Interview
Experience: 1. Given an array of size n this contains all integers from 1 to n+1 except one. Array is notsorted. You have to find the missing element by traversing the array only once and no extraspace allowed.(the solution I proposed was to xor all elements of array and all numbers from1 to n+1 the final value of xor is the answer . He asked me to code this).2. Given a string of characters like “34235” convert it to integer format. (I answered like simplesolution. Was told to code it).3. Given a large file. Each line has some string you have to find palindrome in the string andappend the middle element of palindrome to end of string. It was v important to considercase like when you append characters to end of string it may go to next line and create newpalindromes in next line.(I read 1 line from input file found middle letters of all palindromesappended to string and outputted it in new file say output.txt. Now if it has over flown inoutput file handle it in next iteration …).4. Given a program find output c++ program quite tricky. It was using pointers as member ofclass to test allocation and deallocation of memory.

Round: Technical Interview
Experience: Final Technical Interview 2 Interviewers

1. Tell me something about yourself

2. Explain me your project (was in my resume).

3. Write all dbms tables used in ur project4. How will you represent matrix of any arbitrary size say m*n in a database.(I answered 

5. Given 2 matrix in your database write a sql query to add them.

6. Now write a sql query to multiply 2 matrix

7. Program to find height of a binary tree.(I gave recursive solution)

8. Without recursion

9. Find loop in a binary tree and also find whether loop is sibling loop or ancestor loop or 

10. Can a constructor be virtual?(in c++)

11. Can a destructor be virtual?

12. Can a constructor b private?13. Can a destructor b private?

14. Can a destructor b pure virtual function?......

15. Given a file having 10000 lines I want to read all lines v fast(multi threading)

16. Last do you want to ask some thing ?

(id row col data))

arbitrary loop

Round: Group Activity
Experience: Group Activity-(now no further eliminations) we were divided in group of 3 and 4, 8 or 9 panelists were watching us We were given a list of servers databases and client systems having pros and cons. We were asked to choose the best possible combination that suits all client requirements.

Round: HR Interview
Experience:  Tell something about yourself Greatest achievement in your life
 Achievements of others that u like
 Gave me scenario like you are team leader and you have to instruct your team to deliver blood from blood bank to hospital v v fast as someones life is in danger.. 
 1 more similar case
 Then he asked me r u a team player
 He was like what you do to motivate your team as a leader and how would you make your team perform best.
 Do you want to ask some thing to me???(this is v important ask abt company ur role in it….).

General Tips: Be honest.Do not write anything on resume,people are v v smart they will catch youThey touch all domains so b strong in all areas, dbms os datastructure programmingIf you don’t know something ,tell them, they will help youInterviewers are v cooperative, help you a lot and if you get stuck they will drop hintsBe CALM confident and positiveFinally I would say, interviews with Morgan Stanley , it is a great experience!!ALL THE BEST !!!! 
College Name: VJTI

Interview Preparation Tips

Round: Test
Experience: Aptitude Part : There were 30 questions to be completed in 45 minutes. There were 10 aptitude questions which were quite time-taking. Questions were

from Data Interpretation as well. Then we had to choose a section out of C/C++/JAVA and the rest 20 questions were from your chosen section. The chosen section was also time-consuming.Coding Test : There were 3 questions to be completed in 1 hour. Program 1 was to find the required element of Pascal’s triangle. Program 2 was to count all the palindromic substrings in a string. I am sorry but I do not remember Program 3.
Duration: 105 minutes
Total Questions: 33

Round: Technical Interview
Experience: It lasted for around 30-35 minutes. Questions were on array, hash map, file handling and string theory. All questions were generally algorithmic in nature.

Round: HR Interview
Experience: It lasted for around 50-55 minutes. We were basically grilled in this interview.

Round: Technical Interview
Experience: It lasted for around 1 hour. In this round, there were questions based on real-life scenario like designing a shopping cart for an e-commerce website etc. Then there were algorithmic questions on queue, graph and trees. A problem was given and I was asked to reason out the best data structure to solve that problem. There were simple problems on linked list.

Round: Group Discussion
Experience: It was an entertaining round but was quite pressurising. We were divided into groups and asked to make something with LEGO Blocks that they had provided. There is a time-constraint in this round. We had to explain all the design aspects of our construction like name, choice of colour, significance of buildings, structure strength etc.Finally after 5 rounds of interviews, I got selected. I thank my parents, friends and my seniors.

College Name: NA

Morgan Stanley interview questions for designations

 Technology Specialist

 (1)

 Technical Analyst

 (2)

 Digital Technology Intern

 (1)

 Vp and Technology Manager

 (2)

 Analyst

 (18)

 Operations Analyst

 (6)

 Financial Analyst

 (4)

 Business Analyst

 (3)

Interview Questionnaire 

3 Questions

  • Q1. Explain Bubble Sort
  • Ans. 

    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(...

  • Answered by AI
  • Q2. Given a number, print it in words
  • Ans. 

    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

  • Answered by AI
  • Q3. What are your Strengths and Weakness
  • Ans. 

    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 -...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Aptitude Questions and Questions based on Data Structures, Algorithms, Operating System were asked. Two coding questions were also asked.
Tips: Practice Competitive Programming and some basic aptitude questions as well as basics of CS subjects.
Duration: 1 hour 30 minutes
Total Questions: 17

Round: Technical Interview
Experience: Most question were based on Data Structures and Algorithms. Some questions on Object Oriented Programming were also asked.
Tips: Practice Competitive Programming and Object Oriented Programming Concepts.

Round: Group Activity
Experience: We were given Lego Blocks and told to come convince investors to invest in our product. The Lego blocks were used to make the prototype of our product.

Round: HR Interview
Experience: Normal HR questions were asked

Round: Technical Interview
Experience: Questions on Operating Systems, Databases and Object Oriented Programming were asked

College Name: Fr. Conceicao Rodrigues College Of Engineering

Skills evaluated in this interview

Get interview-ready with Top Morgan Stanley Interview Questions

Technology Analyst Interview Questions & Answers

user image Samarth Gupta

posted on 25 Aug 2017

Interview Questionnaire 

2 Questions

  • Q1. Explain Bubble Sort
  • Ans. 

    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...

  • Answered by AI
  • Q2. Given a number, print it in words
  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: 2 Programming Questions and questions based on CS subjects were asked
Tips: Prepare basic CS subjects and practice competitive programming
Duration: 1 hour 30 minutes
Total Questions: 17

Round: Technical Interview
Experience: Questions based on Data Structures and Algorithms were asked. Also some Object Oriented Programming Questions were asked.
Tips: Practice Competitive Programming and basics of Object Oriented Programming

Round: Group Activity
Experience: Build a prototype for a product and convince investors to invest. The prototype need to be built using Lego blocks.

Round: HR Interview
Experience: Basic HR questions

Round: Technical Interview
Experience: Questions on Databases, Operating Systems and Object Oriented Programming were asked.

College Name: Fr. Conceicao Rodrigues College Of Engineering

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(7 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA and OOPS.

  • Q1. What is an AVL Tree?
  • Ans. 

    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...

  • Answered by AI
  • Q2. Why is the time complexity of Binary Search O(Log n)?
  • Ans. 

    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...

  • Answered by AI
  • Q3. 

    Implementing a Priority Queue Using Heap

    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...

  • Ans. 

    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...

  • Answered by AI
  • Q4. 

    Sum of Digits Problem Statement

    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 ...

  • Ans. 

    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

  • Answered by AI
  • Q5. What is the difference between HashMap and HashSet?
  • Ans. 

    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<>();

  • Answered by AI
  • Q6. What is the difference between an abstract class and an interface in Object-Oriented Programming?
  • Ans. 

    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...

  • Answered by AI
  • Q7. Why are virtual destructors needed?
  • Ans. 

    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 ...

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with questions on OS and OOPS. A design question was also discussed.

  • Q1. What is the Round Robin Algorithm?
  • Ans. 

    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...

  • Answered by AI
  • Q2. How would you design a system where users can subscribe to specific topics, and receive messages whenever a new message is posted related to those topics?
  • Ans. 

    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...

  • Answered by AI
  • Q3. How is memory allocation handled in recursion?
  • Ans. 

    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...

  • Answered by AI
  • Q4. Why are threads needed?
  • Ans. 

    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...

  • Answered by AI
Round 3 - Group Discussion 

Round duration - 45 minutes
Round difficulty - Easy

This was a group activity round.

Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPS, Operating Systems, DBMSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview in Sep 2016.

Interview Questionnaire 

9 Questions

  • Q1. Tell me about yourself.
  • Ans. 

    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

  • Answered by AI
  • Q2. Asked about final year project. What technologies are being used for implementing project. Different algorithms used. How did you compare different algorithms?
  • Q3. Draw and explain about different phases of SDLC(Software Development Life Cycle)
  • Ans. 

    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...

  • Answered by AI
  • Q4. Write logic to find the square root of a number and it should output whether the number is a perfect square or not (You shouldn't use any built-in functions like sqrt() etc..
  • Q5. Why do you choose our company
  • Ans. 

    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

  • Answered by AI
  • Q6. Asked about personal information (family), hobbies.
  • Q7. Asked if there are any issues with the package offered.
  • Q8. Asked personal details
  • Q9. If you are offered job what will you learn before joining the company
  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: 20 questions each from all the above sections. Total 80 questions. Programming questions are mostly output based but they are lengthy.
Tips: Not too difficult. Just manage the time
Duration: 1 hour 20 minutes
Total Questions: 80

Round: Technical Interview
Tips: Most of the questions are resume based. So know each and everything what is present in resume.

Round: HR Interview
Tips: If you are selected in technical interview most chances that you get placed. HR interview is just for formality.

Skills: Database, Programming Skills In Any Language Like C, LOGICAL THINKING ABILITIES
College Name: University of Hyderabad (UOH)

Skills evaluated in this interview

I appeared for an interview in Aug 2017.

Interview Questionnaire 

4 Questions

  • Q1. Tell something about yourself
  • Ans. 

    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

  • Answered by AI
  • Q2. What projects have you done till now
  • Ans. 

    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

  • Answered by AI
  • Q3. What are your future plans (further studies)
  • Ans. 

    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

  • Answered by AI
  • Q4. Why JP Morgan
  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 10multiple choice questions and 2 coding questions
Tips: Out of the 2 coding questions,one can be solved . So better to first understand both the questions and then try to solve atleast one question with most of the test cases correct
Duration: 1 hour 30 minutes
Total Questions: 12

Round: Technical + HR Interview
Experience: Everything about project,front-end and back-end,to draw the data flow diagram and every minute detail about project
Tips: Be clear ,honest, and confident

College Name: Nit Bhopal

I applied via Referral and was interviewed in May 2019. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Basic questions on investment banking operations and the IT department associate with that. Since I was hired for governance team I was asked about some data related queries.

Interview Preparation Tips

Interview preparation tips for other job seekers - Have a commanding communication skills and walk with the confidence. Always believe in yourself and don't tie your ambition with emotions.

Morgan Stanley Interview FAQs

How many rounds are there in Morgan Stanley Technology Analyst interview?
Morgan Stanley interview process usually has 3 rounds. The most common rounds in the Morgan Stanley interview process are Technical and Coding Test.
What are the top questions asked in Morgan Stanley Technology Analyst interview?

Some of the top questions asked at the Morgan Stanley Technology Analyst interview -

  1. Given a number, print it in wo...read more
  2. Explain Bubble S...read more
  3. Asked about CS fundamentals - OS, OOPs e...read more

Tell us how to improve this page.

Morgan Stanley Technology Analyst Interview Process

based on 1 interview

4 Interview rounds

  • Technical Round
  • HR Round
  • Aptitude Test Round
  • Group Activity Round
View more
Morgan Stanley Technology Analyst Salary
based on 52 salaries
₹13 L/yr - ₹29.5 L/yr
179% more than the average Technology Analyst Salary in India
View more details

Morgan Stanley Technology Analyst Reviews and Ratings

based on 5 reviews

3.5/5

Rating in categories

3.0

Skill development

4.1

Work-life balance

3.8

Salary

2.8

Job security

3.2

Company culture

3.0

Promotions

3.0

Work satisfaction

Explore 5 Reviews and Ratings
Associate
3.2k salaries
unlock blur

₹5.2 L/yr - ₹21 L/yr

Senior Manager
2.5k salaries
unlock blur

₹16 L/yr - ₹54 L/yr

Manager
2k salaries
unlock blur

₹10.7 L/yr - ₹42 L/yr

Senior Associate
1.6k salaries
unlock blur

₹7.1 L/yr - ₹27 L/yr

Vice President
1.3k salaries
unlock blur

₹21 L/yr - ₹80 L/yr

Explore more salaries
Compare Morgan Stanley with

JPMorgan Chase & Co.

3.9
Compare

Goldman Sachs

3.5
Compare

TCS

3.7
Compare

Deloitte

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview