Morgan Stanley logo

Morgan Stanley DSA Interview Questions

Preparing for a Morgan Stanley Technology Analyst or SDE interview in 2026? This DSA sheet is built around exactly what Morgan Stanley asks — a balanced mix of core data structures, OOP-heavy design questions, and finance-flavored problems around order books, transaction logs, and scheduling, reflecting the bank's massive trading and risk-management platforms. Morgan Stanley's coding rounds typically move fast through 2-3 problems per interview, rewarding candidates who can write clean, bug-free code under time pressure and reason clearly about complexity. This sheet compiles 60 of the most frequently reported Morgan Stanley interview questions sourced from LeetCode and GeeksforGeeks, tagged by topic, difficulty, and real candidate-reported frequency, so you prep with precision instead of grinding everything on the internet.

60 Problems
0%

Overall Progress

0/60

1. Two Sum
LeetCode•
•
Very Hot
2. Valid Parentheses
LeetCode•
•
Hot
3. Best Time to Buy and Sell Stock
LeetCode•
•
Very Hot
4. Best Time to Buy and Sell Stock II
LeetCode•
•
Hot
5. Maximum Subarray
LeetCode•
•
Hot
6. Merge Intervals
LeetCode•
•
Hot
7. Meeting Rooms II
LeetCode•
•
Hot
8. Group Anagrams
LeetCode•
•
Warm
9. Product of Array Except Self
LeetCode•
•
Warm
10. Subarray Sum Equals K
LeetCode•
•
Hot
11. 3Sum
LeetCode•
•
Hot
12. Container With Most Water
LeetCode•
•
Warm
13. Trapping Rain Water
LeetCode•
•
Warm
14. Search in Rotated Sorted Array
LeetCode•
•
Hot
15. Find First and Last Position of Element in Sorted Array
LeetCode•
•
Warm
16. Kth Largest Element in an Array
LeetCode•
•
Hot
17. Top K Frequent Elements
LeetCode•
•
Warm
18. Find Median from Data Stream
LeetCode•
•
Warm
19. Reverse Linked List
LeetCode•
•
Hot
20. Merge Two Sorted Lists
LeetCode•
•
Warm
21. Linked List Cycle
LeetCode•
•
Warm
22. Add Two Numbers
LeetCode•
•
Hot
23. LRU Cache
LeetCode•
•
Very Hot
24. Binary Tree Level Order Traversal
LeetCode•
•
Hot
25. Validate Binary Search Tree
LeetCode•
•
Hot
26. Lowest Common Ancestor of a Binary Tree
LeetCode•
•
Hot
27. Maximum Depth of Binary Tree
LeetCode•
•
Warm
28. Diameter of Binary Tree
LeetCode•
•
Warm
29. Number of Islands
LeetCode•
•
Hot
30. Course Schedule
LeetCode•
•
Warm
31. Clone Graph
LeetCode•
•
Warm
32. Word Break
LeetCode•
•
Warm
33. Coin Change
LeetCode•
•
Warm
34. House Robber
LeetCode•
•
Warm
35. Climbing Stairs
LeetCode•
•
Warm
36. Longest Increasing Subsequence
LeetCode•
•
Warm
37. Edit Distance
LeetCode•
•
Hot
38. Word Search
LeetCode•
•
Warm
39. Subsets
LeetCode•
•
Warm
40. Permutations
LeetCode•
•
Warm
41. Generate Parentheses
LeetCode•
•
Warm
42. Implement Queue using Stacks
LeetCode•
•
Warm
43. Min Stack
LeetCode•
•
Hot
44. Evaluate Reverse Polish Notation
LeetCode•
•
Warm
45. Design Twitter
LeetCode•
•
Warm
46. Insert Delete GetRandom O(1)
LeetCode•
•
Warm
47. Copy List with Random Pointer
LeetCode•
•
Warm
48. Spiral Matrix
LeetCode•
•
Warm
49. Rotate Image
LeetCode•
•
Warm
50. Design an ATM Machine
LeetCode•
•
Hot
51. Design a Stock Order Book System
GeeksforGeeks•
•
Hot
52. Design a Parking Lot System
LeetCode•
•
Hot
53. Design a Vending Machine
GeeksforGeeks•
•
Warm
54. Detect Cycle in a Directed Graph
GeeksforGeeks•
•
Warm
55. Dijkstra's Shortest Path Algorithm
GeeksforGeeks•
•
Warm
56. Longest Common Subsequence
GeeksforGeeks•
•
Warm
57. Find the Kth Smallest Element in an Unsorted Array
GeeksforGeeks•
•
Warm
58. Job Sequencing Problem
GeeksforGeeks•
•
Warm
59. Rat in a Maze Problem
GeeksforGeeks•
•
Warm
60. Design a Library Management System
LeetCode•
•
Warm