Morgan Stanley Interview Experience for SDE 1 | On-Campus 2021
- Percentage in X and XII : 70% or 7.0 CGPA
- Pursuing Degree: 80% or 80 CGPA
- No Standing Arrears
Round 1: Online Assessment
Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!
Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsft, TCS, Wipro, Google and many more!
This round was conducted on AMCAT. It consisted of 4 sections.
- Debugging: This section had 7 questions with a time limit of 20 minutes.
- Aptitude: This section had 16 questions to be solved in 20 minutes. Questions were mostly from speed distance, direction based, number theory, etc.
- CSE Fundamentals: This round had around 30 questions based on DBMS, OS, OOPS, Networks.
- Coding: This section is comprised of 3 coding questions to be solved in 60 minutes. The first question was based on updating a subarray with a certain value and finding the maximum frequency of any value in the array. The second question was a variant of merge intervals and the third question was the minimum cost to make 2 strings identical.
Out of 389 students, 48 students were shortlisted for the second round.
Round 2: Technical Interview 1
Time :1 hour
- I was asked to introduce myself and then he started asking questions related to Java-like what is an inner class and told me to code it. Next, I was asked about access modifiers and constructor chaining in Java, virtual memory, semaphores, the difference between threads and process, 2 NF, SQL queries for finding the Second Maximum value in a column and finding Nth Maximum value in a column and query related to GROUP BY. Next, he told me to check for a balanced tree https://practice.geeksforgeeks.org/problems/check-for-balanced-tree/1. The last question was to find maximum profit where we are given n-days with n-cost of mangoes and maximum profit had to be found if a person buys mangoes on a day and sells it on any other day after he bought them. It was a basic array question.
Round 3: Technical Interview 2
Time: 1 hour
- I was asked to code a parking lot system design provided there are N floors with different parking spaces and costs, I had to design classes such that the user has to pay the minimum cost for parking. This went for around 40 minutes and then he asked me to explain my project and the ML algorithms used.
Unfortunately, I wasn’t shortlisted for the HR round.