**Morgan Stanley (Code to Give) OA**\nHad Three Sections\n\n\n**Debugging Section - 10 Questions, 20 Minutes**\nEasy syntax related problems\nmatrix addition, bubble sort, selection sort,string comparision, etc.\nminor changes\nAptitude Section - 24 Questions, 40 Minutes\nGeneral Aptitude Questions\nCoding Round - 3 Questions, 60 Minutes\n**Q1. House Robber**\n[House Robber-1](https://leetcode.com/problems/house-robber/description/)\n(Differently worded though.)\n\n\n**Q2.**\nFind the number of subarrays that can be removed, such that the remaining array is strictly increasing (non-empty).\n\nhttps://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/description/\nCount the subarray using two pointer until invalid condition\n\n\n**Q3 Subarrays with exactly k different integers**\n[Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers/description/)\n(Again, differently worded)

Morgan Stanley (Code to Give) OA\nHad Three Sections\n\n\nDebugging Section - 10 Questions, 20 Minutes\nEasy syntax related problems\nmatrix addition, bubble so