Morgan Stanley Placement Papers 2026

Truth check — what actually matters for Morgan Stanley 2026

Morgan Stanley India's 2026 hiring has been concentrated in Mumbai and Bangalore, with technology, quantitative analyst, and investment-banking-analyst tracks operating as visibly different funnels. Prep mismatch between tracks is the most common candidate error.

The 2026 snapshot: ~5 active roles tracked, which is artifactually low, Morgan Stanley's careers portal is one of the slowest to update from a scrape perspective. Actual hiring volume is multiples of that.

What guides get wrong: the Technology fresher track uses a standard coding + system-design + behavioral loop, but the behavioral round at MS is unusually rigorous. Expect 4-5 STAR-format questions with multiple follow-ups per question. Candidates with thin behavioral inventory get filtered here even with strong technical signals.

For Quant Analyst roles, the prep is closer to top-tier hedge-fund interviews, brain-teasers, probability puzzles, mental-math under pressure, and statistics-fluency at a graduate level. This is a different prep target from Technology and should not be combined.

The HR round at MS is direct and probing. "Why Morgan Stanley over Goldman" is a standard question, and candidates who do not have a substantive non-prestige answer lose.

If you have 2 weeks for Morgan Stanley Technology only: 5 days of LeetCode-medium clean-code; 3 days of finance-fundamentals (debt vs equity capital markets, basic derivatives); 3 days of behavioral with deep STAR inventory; 3 days of system-design (caching, queueing, basic distributed primitives).

Eligibility Criteria

Morgan Stanley Selection Process 2026

1. Online Application / Campus Registration – Apply through your college placement portal or Morgan Stanley careers page. Resume shortlisting is done based on CGPA and project quality.

2. Online Aptitude & Coding Test – Conducted on HackerRank or Mettl platform. Duration: 90–120 minutes. Includes quantitative aptitude, logical reasoning, and 2–3 coding problems.

3. Technical Interview Round 1 – 45–60 minute interview focused on Data Structures, Algorithms, OOP, DBMS, and one programming language (C++/Java/Python). Expect LeetCode medium-level problems.

4. Technical Interview Round 2 – Deeper dive into system design (for experienced roles), advanced DS&A, OS concepts, and project discussion. Some interviewers ask finance-specific questions (what is a derivative, how does a stock exchange work).

5. HR Interview – Behavioral questions using STAR format, culture fit assessment, compensation discussion. Usually 30 minutes.

6. Final Offer – Background verification followed by offer letter. Onboarding is typically 3–6 months after the interview.

Exam Pattern

Note: Negative marking is typically absent in coding rounds. The aptitude section may have -0.25 per wrong answer.

Practice Questions with Detailed Solutions

Aptitude Questions

Q1. A train 200 m long passes a pole in 10 seconds. How long will it take to pass a platform 300 m long?

Solution:

• Speed of train = Distance / Time = 200 / 10 = 20 m/s
• To pass a 300 m platform, total distance = 200 + 300 = 500 m
• Time = 500 / 20 = 25 seconds

✅ Answer: 25 seconds

Q2. If 12 men can do a piece of work in 20 days, in how many days can 15 men do the same work?

Solution:

• Total work = 12 × 20 = 240 man-days
• Days for 15 men = 240 / 15 = 16 days

✅ Answer: 16 days

Q3. A sum of money doubles itself at simple interest in 10 years. What is the rate of interest per annum?

Solution:

• Let principal = P, then Amount = 2P, so SI = P
• SI = (P × R × T) / 100
• P = (P × R × 10) / 100
• R = 100 / 10 = 10% per annum

✅ Answer: 10% p.a.

Q4. In a class of 60 students, 40% are girls. If 30% of boys and 40% of girls passed an exam, how many students passed?

Solution:

• Girls = 60 × 0.40 = 24; Boys = 36
• Passed girls = 24 × 0.40 = 9.6 ≈ 10 (if fractions allowed, else check for whole numbers)
• Let's recompute: 40% of 60 = 24 girls; 36 boys
• Passed = (36 × 0.30) + (24 × 0.40) = 10.8 + 9.6 = 20.4 → ~20 students

✅ Answer: ~20 students (often given as exact integers in real tests; verify data)

Q5. Two pipes A and B can fill a tank in 12 and 18 hours respectively. Both are opened together. After 4 hours, pipe B is closed. How much more time is needed to fill the tank?

Solution:

• In 1 hour, A fills 1/12, B fills 1/18
• Together in 1 hour: 1/12 + 1/18 = 3/36 + 2/36 = 5/36
• In 4 hours: 4 × 5/36 = 20/36 = 5/9
• Remaining = 1 − 5/9 = 4/9
• Only A fills remaining: Time = (4/9) / (1/12) = (4/9) × 12 = 48/9 = 16/3 ≈ 5.33 hours

✅ Answer: 5 hours 20 minutes

Q6. Find the next number in the series: 2, 6, 12, 20, 30, ?

Solution:

• Differences: 4, 6, 8, 10 → next difference = 12
• 30 + 12 = 42
• Pattern: n(n+1) → 1×2=2, 2×3=6, 3×4=12, 4×5=20, 5×6=30, 6×7=42

✅ Answer: 42

Q7. A shopkeeper sells an article at ₹1,080 after giving a 10% discount on marked price. What is the marked price?

Solution:

• SP = MP × (1 − discount%)
• 1080 = MP × 0.90
• MP = 1080 / 0.90 = ₹1,200

✅ Answer: ₹1,200

Q8. In how many ways can the letters of the word "FINANCE" be arranged?

Solution:

• FINANCE has 7 letters: F, I, N, A, N, C, E
• N repeats twice
• Total arrangements = 7! / 2! = 5040 / 2 = 2,520

✅ Answer: 2,520

Q9. The average of 5 numbers is 40. If one number is excluded, the average becomes 36. What is the excluded number?

Solution:

• Sum of 5 numbers = 5 × 40 = 200
• Sum of remaining 4 = 4 × 36 = 144
• Excluded number = 200 − 144 = 56

✅ Answer: 56

Logical Reasoning

Q10. All cats are animals. Some animals are dogs. Which conclusion is definitely true?

A) Some cats are dogs
B) Some animals are cats
C) All dogs are cats
D) No cats are dogs

Solution:

• "All cats are animals" → cats ⊆ animals → some animals ARE cats (the cats)
• B is definitely true.

✅ Answer: B) Some animals are cats

Q11. Pointing to a man, a woman says "His mother is the only daughter of my mother." How is the woman related to the man?

Solution:

• "Only daughter of my mother" = the woman herself
• So the man's mother = the woman
• The woman is the man's mother

✅ Answer: Mother

Coding Questions

Q12. Write a function to find the maximum subarray sum (Kadane's Algorithm).

Problem: Given an integer array, find the contiguous subarray with the largest sum.

def max_subarray_sum(arr):
    max_sum = arr[0]
    current_sum = arr[0]
    
    for i in range(1, len(arr)):
        # Either extend existing subarray or start fresh
        current_sum = max(arr[i], current_sum + arr[i])
        max_sum = max(max_sum, current_sum)
    
    return max_sum

# Example
arr = [-2, 1, -3, 4, -1, 2, 1, -5, 4]
print(max_subarray_sum(arr))  # Output: 6 (subarray [4, -1, 2, 1])

Explanation:

• Time Complexity: O(n)
• Space Complexity: O(1)
• Key insight: At each element, decide whether to extend current subarray or start a new one.

Q13. Reverse a linked list (iterative approach).

class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

def reverse_linked_list(head):
    prev = None
    current = head
    
    while current:
        next_node = current.next  # Save next
        current.next = prev       # Reverse pointer
        prev = current            # Move prev forward
        current = next_node       # Move current forward
    
    return prev  # New head

# Time: O(n), Space: O(1)

Explanation: We maintain three pointers: prev, current, and next_node. At each step we flip the pointer direction.

Q14. Check if a string is a valid parenthesis sequence.

def is_valid_parentheses(s):
    stack = []
    mapping = {')': '(', '}': '{', ']': '['}
    
    for char in s:
        if char in mapping:
            top = stack.pop() if stack else '#'
            if mapping[char] != top:
                return False
        else:
            stack.append(char)
    
    return not stack  # Stack must be empty

# Test cases
print(is_valid_parentheses("()[]{}"))   # True
print(is_valid_parentheses("([)]"))     # False
print(is_valid_parentheses("{[]}"))     # True

Q15. Find all duplicates in an array of integers where 1 ≤ a[i] ≤ n.

def find_duplicates(nums):
    result = []
    
    for num in nums:
        index = abs(num) - 1
        if nums[index] < 0:
            result.append(abs(num))  # Already negated = duplicate
        else:
            nums[index] = -nums[index]  # Mark as visited
    
    return result

# Example
nums = [4, 3, 2, 7, 8, 2, 3, 1]
print(find_duplicates(nums))  # [2, 3]
# Time: O(n), Space: O(1) (modifies input in-place)

HR Interview Questions with Sample Answers

Q1. Tell me about yourself.

"I'm a final-year Computer Science student from [College]. Over the past 4 years, I've built a strong foundation in data structures, algorithms, and full-stack development. My key project was building a real-time stock portfolio tracker using Python, React, and WebSockets, which taught me a lot about low-latency systems, something I know is central to Morgan Stanley's work. I'm passionate about writing clean, maintainable code and I'm excited about the opportunity to contribute to financial technology at global scale."

Q2. Why Morgan Stanley specifically, not just any investment bank?

"Morgan Stanley's India Technology Center is genuinely different. The ITC teams own real production systems, not just back-office support. I've read about how Morgan Stanley engineers built the Matrix trading platform and the firm's risk analytics engine. The scale of the financial data problem and the performance requirements are exactly the kind of engineering challenges I want to work on. Plus, the mentorship culture here is well-regarded, Glassdoor reviews consistently highlight that."

Q3. Describe a time you handled a high-pressure situation.

"During my final-year project demo, our database crashed two hours before the presentation. Instead of panicking, I quickly set up a local SQLite fallback and adjusted the demo script to showcase the most important features. The professor appreciated the composure and problem-solving. The key lesson: always have a contingency plan, and stay calm when plans fail."

Q4. Where do you see yourself in 5 years?

"I'd like to grow into a senior engineer role, ideally owning a significant piece of infrastructure at Morgan Stanley, perhaps a trading system or risk platform. I also want to develop cross-functional skills in finance so I can bridge the gap between technology and business. Long term, I'd love to lead a team."

Q5. Do you have any questions for us?

"Yes, I'd love to understand what a typical first 3 months look like for a new analyst joining ITC. How quickly do new hires get to contribute to production code? And are there opportunities to rotate across different teams to understand different parts of the business?"

Preparation Tips

• Master LeetCode Medium problems, Morgan Stanley frequently tests graph traversal, dynamic programming, and sliding window problems in the coding round.
• Study financial basics, Know what stocks, bonds, derivatives, and options are. Interviewers occasionally test this for tech roles too.
• Build projects with real-world data, A portfolio tracker, algorithmic trading simulator, or financial data API project will stand out.
• Practice STAR-format answers, Situation, Task, Action, Result. Prepare 6–8 stories covering teamwork, failure, leadership, and problem-solving.
• Understand system design at a conceptual level, Even for fresher roles, Morgan Stanley respects candidates who can talk about scalability, fault tolerance, and data consistency.
• Review OS and Networking fundamentals, Thread synchronization, memory management, HTTP vs. TCP/IP, these come up in technical rounds.
• Use GeeksForGeeks + InterviewBit, Both have dedicated Morgan Stanley question sets that are highly relevant.

You May Also Like

• Morgan Stanley Interview Questions 2026 - Round-by-Round Guide

• Jp Morgan Placement Papers 2026

• Jp Morgan Interview Questions 2026

🎯 Live Mock Test, May 2026 Edition

5 original questions written by Aditya Sharma, calibrated to the Morgan Stanley 2026 batch difficulty. Click any option to lock your answer; solutions reveal after.