Morgan Stanley (Code to Give) OA Had Three Sections 1. Debugging Section - 10 Questions, 20 Minutes \t Easy syntax related problems \t matrix addition, bubble sort, selection sort,string comparision, etc. \t minor changes 2. Aptitude...

Morgan Stanley (Code to Give) OA

Had Three Sections
1. Debugging Section - 10 Questions, 20 Minutes
\t Easy syntax related problems
\t matrix addition, bubble sort, selection sort,string comparision, etc.
\t minor changes
2. Aptitude Section - 24 Questions, 40 Minutes
\t General Aptitude Questions
3. Coding Round - 3 Questions, 60 Minutes

Q1. House Robber
House Robber-1
(Differently worded though.)

Q2.
Find the number of subarrays that can be removed, such that the remaining array is strictly increasing (non-empty).
1574. Shortest Subarray to be Removed to Make Array Sorted

Q3 Subarrays with exactly k different integers
Subarrays with K Different Integers
(Again, differently worded)

Edit : Added 2nd Problem Link.