I applied through a recruiter. I interviewed at Morgan Stanley
Interview
I got call through naukri
- Interview process consists of 5 round
- 1st Round - Online coding test ( 3 Java coding questions - medium level)
- 2nd round - Technical Interview ( Core Java questions with Coding as well focus was on multithreading)
- 3rd round - Technical Interview ( Java questions and logic in deep with Coding)
- 4th round - Managerial (Project domain knowledge, processes followed, core java questions mostly on mutithreading, coding as well)
Interview questions [1]
Question 1
1) How ConcurrentHash Map works
2) Blocking queue implementation
3) write code for producer consumer problem
4) write code to print even odd in sequence using MultiThreading
I applied through a staffing agency. The process took 3 days. I interviewed at Morgan Stanley (Mumbai) in Jun 2021
Interview
1.Round Hacker Rank -90 minutes
2. Zoom video call - Some general Java concepts
and some programs .
I was very confident that all is going good. I had completed all the given programs and they are working as expected for all the test cases. Given answer to all the theoretical questions.
But don’t know intervewer say that she is expecting some other answers. I dint know why interviewers think that approach/solution to a problem will be the same as they know or think.
Every technical problem can be solved in many ways. Anyways you can not control the decision.
Interview questions [1]
Question 1
Design Vending Machine
Buy/ Sale Stock - Find the day when you will have the max profit.
I applied online. I interviewed at Morgan Stanley (Mumbai) in Apr 2021
Interview
There were 4 rounds. First round will be hackerank test consist of MCQs and Program. Difficulty was moderate. Then 3 F2F round interview. First round, interviewer asked me all the core java questions from all the topics including exceptions handling, collections, generic, String etc. Core java concepts should be good to clear the round, 2 coding questions were also there on hacker rank codepair. 1. Find the 2nd largest number in array without using any inbuilt method in O(n), 2. print fibonaci series till n, without using recursion. My 2nd and 3rd round taken together. Interviewer asked 4 programs to write on notepad. 1. find intersection noide of two linkedlist.2 find all the cousins of the node in BST. 3. Implement stack using Queue.4. print the number in english words for ex;4563 should be printed as "four thousand six hundred three.
Interview questions [1]
Question 1
1. find intersection noide of two linkedlist.2 find all the cousins of the node in BST. 3. Implement stack using Queue.4. print the number in english words for ex;4563 should be printed as "four thousand six hundred three.