Morgan Stanley Coding Questions - DSA Problems & Solutions

Company Overview

This page contains Morgan Stanley coding questions from Morgan Stanley OA placement papers with detailed solutions.

Coding Focus

Morgan Stanley OA coding section includes 2-3 problems focusing on DSA. Master arrays, trees, graphs, and dynamic programming to succeed.

Morgan Stanley Coding Questions Overview

Morgan Stanley OA Coding Section:

• Problems: 2-3 coding problems
• Time: 60-90 minutes
• Languages: C, C++, Java, Python

Coding Problems

Question 1: Longest Increasing Subsequence

Q1: Find the length of the longest strictly increasing subsequence.

Solution (Java):

public int lengthOfLIS(int[] nums) {
    int[] dp = new int[nums.length];
    Arrays.fill(dp, 1);
    int maxLen = 1;

    for (int i = 1; i < nums.length; i++) {
        for (int j = 0; j < i; j++) {
            if (nums[j] < nums[i]) {
                dp[i] = Math.max(dp[i], dp[j] + 1);
            }
        }
        maxLen = Math.max(maxLen, dp[i]);
    }

    return maxLen;
}

Time Complexity: O(n²)

Related Resources

Morgan Stanley 2024 Papers

Previous year papers with coding questions

View 2024 Papers →

Morgan Stanley Main Page

Complete Morgan Stanley placement guide

View Main Page →

---

Practice Morgan Stanley coding questions regularly!