Morgan Stanley | SDE - II | India | July 2021 | Offer
Summary
I interviewed for an SDE - II position at Morgan Stanley in India in July 2021 and successfully received an offer after navigating through 4 rounds that covered coding, core Java, system design, and managerial aspects.
Full Experience
I interviewed for the SDE - II role at Morgan Stanley in July 2021. I have 4.5 years of experience as a backend developer. The interview process consisted of 4 rounds.
Round 1: Hacker Rank Online (1 Hour)
This round included a mix of MCQs and one medium-level coding question.
Round 2: Technical (1 Hour)
This round primarily focused on Core Java and Multithreading. I was asked two data structure questions:
- The classic House Robber problem (medium difficulty).
- A problem involving searching in a matrix sorted by row (medium difficulty).
Round 3: Technical (1 Hour)
This round covered Core Java and Spring topics. I also solved one data structure question:
- Removing consecutive characters in a string (easy difficulty).
Round 4: Technical + Managerial (50 minutes)
This was a comprehensive round combining technical and managerial aspects. I faced system design problems, specifically discussing how to remove duplicate lines from a 10 GB file with only 2 GB of memory. Other topics included basic memory management, garbage collection, detecting performance issues in production, and discussions related to my projects. Additionally, there was one data structure question:
- Given an input array and a desired output array, I had to return the sequence of stack operations to transform the input to produce the output. For example, for an input
[2,3,4,5,6]and output[3,4,5,2,6], the answer would involve operations like[push-2, push-3, push-4, pop-4, push-5...].
After successfully completing all these rounds, I received an offer.
Interview Questions (5)
Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police. Adjacent houses have security systems connected and will automatically contact the police if two adjacent houses are broken into on the same night.
Given an m x n matrix where each row is sorted in non-decreasing order, write an algorithm to search for a target value in the matrix.
Given a string, remove all consecutive duplicate characters from it. For example, if the input is 'aaabbcddde', the output should be 'abcde'.
Design a system or algorithm to remove duplicate lines from a 10 GB file, given only 2 GB of available memory.
Given an input array and a desired output array, determine the sequence of stack operations (push, pop) required to transform the input array elements into the output array. Assume elements are pushed onto the stack from the input array in order.
Example:
Input: [2,3,4,5,6]
Output: [3,4,5,2,6]
Expected Answer Format: [push-2, push-3, push-4, pop-4, push-5...]