Morgan Stanley | Sr. Associate JAVA | Mumbai | June

[ OK ] 67Ijgtm15e — full writeup

[ INFO ] category: Behavioral · Phone Screen difficulty: average freq: first seen: 2022-06-07

[AVERAGE][PHONE SCREEN]Phone ScreenSWE II (Mid-Level)Unknown

$ cat problem.md

Online Assessment

12 Multiple Choice Questions based on Java and Spring.
1 SQL Query
Maximum length subsequence with a difference between elements as either 0 or 1.

Technical Round I

John can watch a maximum of 3 hours of movies in a day and he only watches movies if he can watch them completely. You are given a list containing the duration of movies, find the minimum number of days taken by him to finish watching all the movies. Input: ArrayList<Float> duration Constraints: 0<duration[i]<= 3.0 Duration.length<=10000

Few questions about the projects I had worked on.

user@intervues:~/experiences/morgan-stanley$