## Morgan Stanley Interview | (For 2 years experienced)

It was a recruitment drive for Morgan Stanley for Experienced Java developers for their Mumbai office. Round 1: Pen/Paper Round 1 consisted of 10 questions,… Read More »

- Largest Sum Contiguous Subarray
- Coin Change | DP-7
- Activity Selection Problem | Greedy Algo-1
- Sort an array of 0s, 1s and 2s
- Print a given matrix in spiral form
- Huffman Coding | Greedy Algo-3
- Find minimum number of coins that make a given value
- Maximum Sum Increasing Subsequence | DP-14
- Median in a stream of integers (running integers)
- Find next greater number with same set of digits
- Count ways to reach the n'th stair
- Largest subarray with equal number of 0s and 1s
- Median of Stream of Running Integers using STL
- Clone a linked list with next and random pointer | Set 1
- Find the minimum element in a sorted and rotated array
- Remove duplicates from sorted array
- Find day of the week for a given date
- Print level order traversal line by line | Set 1
- Maximum Product Subarray
- Write your own atoi()
- Clone a linked list with next and random pointer | Set 2
- Count numbers from 1 to n that have 4 as a digit
- Morgan Stanley Interview (On campus for Internship)
- Swap Kth node from beginning with Kth node from end in a Linked List
- Morgan Stanley Interview Experience (On-Campus 2018)
- Level order traversal line by line | Set 2 (Using Two Queues)
- Morgan Stanley Interview Experience (On-Campus)
- Largest even number possible by using one swap operation in given number
- Minimum number of distinct elements after removing m items
- Morgan Stanley Technology Analyst Interview (For FTE)

It was a recruitment drive for Morgan Stanley for Experienced Java developers for their Mumbai office. Round 1: Pen/Paper Round 1 consisted of 10 questions,… Read More »

Given a number n. Count the number of changes in LED light when display one after another of a given number. (Initially all LED is… Read More »

Morgan Stanley visited our campus for selecting interns (summer analyst) this year for the first time. There were 3 rounds : 1. Online (Technical) 2.… Read More »

MorganStanley came to our college for campus recruitment. The first round was online test, 7 questions some error correction (whether syntax or logical error), aptitude… Read More »

Morgan Stanley visited our campus for hiring FTE and interns for the position of Technology Analyst. It expected a decent GPA and only those students… Read More »

Round 1: Online Test Platform – aspireminds section 1 : 7 code snippets – some corrections to be made in each of the code snippet… Read More »

About the Company Recruitment Process Questions asked in Morgan Stanley Interview Experiences Where To Apply About the Company: Morgan Stanley is an American multinational investment… Read More »

Morgan Stanley has been operating in India for over 20 years, providing a variety of services to domestic and international clients. The Firm has a… Read More »

Morgan Stanley: Given two arrays A, B and a required array wanted. You are given 8 functions each with a fixed length (example functions 1.… Read More »

Morgan Stanley First Round : Telephonic round I was interviewing for Java developer post at Mumbai office of Morgan Stanley. Interview mostly consisted of multi-threading… Read More »

Round 1 – MCQ+Coding Students from 4 colleges participated in this round out of which 30 were selected. This round consisted of 13 aptitude type… Read More »

Aptitude Test(90 mins, on Hackerrank) 7 aptitude questions based on Math and Logic< 7 Technical Subject Questions on Data Structures, 1 from OS(Few of them… Read More »

The aptitude test was of 75 minutes and had two parts: 1. MCQs and 2. Coding Just before the test started a sample test consisting… Read More »

Round 1 Online test on HackerRank contains 15 MCQ (Quanta, Probability and Reasoning (11), CS (4) etc.) 2Coding Questions 1. Given height (h) and width… Read More »

Given an array of items, an i-th index element denotes the item id’s and given a number m, the task is to remove m elements… Read More »