Morgan Stanley Coding Interview Questions
We track 53 coding questions asked at Morgan Stanley, tagged with the algorithms and concepts they test. The most common: Array, Dynamic Programming, Hash Table, String, Greedy.
Browse all 53 Morgan Stanley questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array26.8%
- Dynamic Programming9.9%
- Hash Table8.5%
- String7.8%
- Two Pointers5.4%
- Greedy5.1%
- Stack4.6%
- Sorting4.5%
- Math3.6%
- Linked List3.4%
- Other (21)20.3%
How many questions involve each concept
Share of all 53 tracked Morgan Stanley questions that touch each concept. Questions usually involve several, so these overlap.
- Array67.9%
- Dynamic Programming26.4%
- Hash Table26.4%
- String22.6%
- Greedy15.1%
- Sorting15.1%
- Stack15.1%
- Two Pointers15.1%
- Linked List9.4%
- Binary Search7.5%
- Counting7.5%
- Math7.5%
Where Morgan Stanley differs from the average company
Concept weight at Morgan Stanley relative to the average across all companies we track. Green means Morgan Stanley leans on it harder than most.
- Queue3.5×
- Monotonic Stack3.1×
- Stack1.8×
- Counting1.8×
- Backtracking0.77×
- Math0.64×
- Prefix Sum0.63×
- Matrix0.43×
Morgan Stanley specialties
Concepts that show up at Morgan Stanley but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 53 tracked Morgan Stanley questions.
- Junior23% (12)
- Mid/Senior66% (35)
- Staff11% (6)
Every concept in Morgan Stanley interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 36 | 67.9% | 26.8% |
| Dynamic Programming | 14 | 26.4% | 9.9% |
| Hash Table | 14 | 26.4% | 8.5% |
| String | 12 | 22.6% | 7.8% |
| Greedy | 8 | 15.1% | 5.1% |
| Sorting | 8 | 15.1% | 4.5% |
| Stack | 8 | 15.1% | 4.6% |
| Two Pointers | 8 | 15.1% | 5.4% |
| Linked List | 5 | 9.4% | 3.4% |
| Binary Search | 4 | 7.5% | 2.6% |
| Counting | 4 | 7.5% | 1.8% |
| Math | 4 | 7.5% | 3.6% |
| Monotonic Stack | 4 | 7.5% | 2.2% |
| Sliding Window | 4 | 7.5% | 2.0% |
| Queue | 3 | 5.7% | 1.4% |
| Backtracking | 2 | 3.8% | 1.0% |
| Matrix | 2 | 3.8% | 1.0% |
| Prefix Sum | 2 | 3.8% | 1.0% |
| Recursion | 2 | 3.8% | 1.0% |
| Binary Indexed Tree | 1 | 1.9% | 0.6% |
| Bit Manipulation | 1 | 1.9% | 1.0% |
| Breadth-First Search | 1 | 1.9% | 0.6% |
| Depth-First Search | 1 | 1.9% | 0.4% |
| Design | 1 | 1.9% | 0.5% |
| Divide and Conquer | 1 | 1.9% | 0.4% |
| Doubly-Linked List | 1 | 1.9% | 0.5% |
| Heap (Priority Queue) | 1 | 1.9% | 0.4% |
| Monotonic Queue | 1 | 1.9% | 0.5% |
| Number Theory | 1 | 1.9% | 0.4% |
| Quickselect | 1 | 1.9% | 0.4% |
| Simulation | 1 | 1.9% | 0.6% |
Practice a Morgan Stanley interview
Take a realistic AI-led mock interview with questions Morgan Stanley actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required