DSA Doctor
Verified Company Vault
Morgan Stanley DSA Interview Questions
55 curated coding interview questions directly asked in Morgan Stanley technical rounds, sorted by frequency with recency and difficulty diagnostics.
55
Total Questions
13 (24%)
Easy Problems
36 (65%)
Medium Problems
6 (11%)
Hard Problems
🔥 Most Tested Topics:
Arrays (24)Strings (11)Core DSA (9)Trees (5)Linked List (4)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 740 | Delete and Earn | Medium | Core DSA | Implementation / Reasoning | 57.2% | 100.0% | 3m |
| 1626 | Best Team With No Conflicts | Medium | Core DSA | Implementation / Reasoning | 50.7% | 100.0% | all |
| 1964 | Find the Longest Valid Obstacle Course at Each Position | Hard | Strings; Trees; Graphs | Hashing / Sliding Window; DFS / BFS; BFS / DFS / Topological Sort | 62.5% | 87.5% | all |
| 2152 | Minimum Number of Lines to Cover Points | Medium | Arrays | Sorting / Prefix / Scan | 44.0% | 87.5% | all |
| 1217 | Minimum Cost to Move Chips to The Same Position | Easy | Arrays | Sorting / Prefix / Scan | 72.9% | 87.5% | all |
| 2395 | Find Subarrays With Equal Sum | Easy | Arrays | Sorting / Prefix / Scan | 67.0% | 87.5% | all |
| 2432 | The Employee That Worked on the Longest Task | Easy | Core DSA | Implementation / Reasoning | 51.7% | 87.5% | all |
| 2433 | Find The Original Array of Prefix Xor | Medium | Arrays | Sorting / Prefix / Scan | 88.4% | 87.5% | all |
| 1470 | Shuffle the Array | Easy | Arrays | Sorting / Prefix / Scan | 88.8% | 75.0% | 3m |
| 9 | Palindrome Number | Easy | Strings | Hashing / Sliding Window | 60.6% | 75.0% | 6m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | 6m |
| 143 | Reorder List | Medium | Linked List | Two Pointers | 65.3% | 75.0% | 6m |
| 19 | Remove Nth Node From End of List | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 51.6% | 75.0% | 6m |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 75.0% | 6m |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 75.0% | all |
| 2444 | Count Subarrays With Fixed Bounds | Hard | Arrays | Sorting / Prefix / Scan | 69.2% | 75.0% | all |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 62.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 62.5% | all |
| 138 | Copy List with Random Pointer | Medium | Linked List | Two Pointers | 62.9% | 62.5% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 62.5% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 62.5% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 62.5% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 62.5% | all |
| 936 | Stamping The Sequence | Hard | Core DSA | Implementation / Reasoning | 62.3% | 62.5% | all |
| 2607 | Make K-Subarray Sums Equal | Medium | Arrays | Sorting / Prefix / Scan | 38.6% | 62.5% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 62.5% | all |
| 387 | First Unique Character in a String | Easy | Strings | Hashing / Sliding Window | 65.5% | 62.5% | all |
| 739 | Daily Temperatures | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.7% | 62.5% | all |
| 496 | Next Greater Element I | Easy | Stack / Queue | Monotonic Stack / Simulation | 76.1% | 50.0% | all |
| 525 | Contiguous Array | Medium | Arrays | Sorting / Prefix / Scan | 51.3% | 50.0% | all |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 50.0% | all |
| 992 | Subarrays with K Different Integers | Hard | Arrays | Sorting / Prefix / Scan | 68.1% | 50.0% | all |
| 26 | Remove Duplicates from Sorted Array | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 62.8% | 50.0% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 50.0% | all |
| 1539 | Kth Missing Positive Number | Easy | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 63.5% | 50.0% | all |
| 518 | Coin Change II | Medium | Dynamic Programming | State Transition | 60.0% | 50.0% | all |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 50.0% | all |
| 1658 | Minimum Operations to Reduce X to Zero | Medium | Arrays | Sorting / Prefix / Scan | 40.6% | 50.0% | all |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 61.3% | 50.0% | all |
| 1143 | Longest Common Subsequence | Medium | Core DSA | Implementation / Reasoning | 59.2% | 50.0% | all |
| 556 | Next Greater Element III | Medium | Stack / Queue | Monotonic Stack / Simulation | 35.3% | 50.0% | all |
| 3144 | Minimum Substring Partition of Equal Character Frequency | Medium | Arrays; Strings; Trees; Dynamic Programming | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; State Transition | 40.3% | 50.0% | all |
| 1529 | Minimum Suffix Flips | Medium | Arrays | Sorting / Prefix / Scan | 73.9% | 50.0% | all |
| 503 | Next Greater Element II | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.4% | 50.0% | all |
| 1326 | Minimum Number of Taps to Open to Water a Garden | Hard | Arrays | Sorting / Prefix / Scan | 51.0% | 50.0% | all |
| 1481 | Least Number of Unique Integers after K Removals | Medium | Core DSA | Implementation / Reasoning | 63.8% | 50.0% | all |
| 135 | Candy | Hard | Core DSA | Implementation / Reasoning | 48.5% | 50.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 50.0% | all |
| 152 | Maximum Product Subarray | Medium | Arrays | Sorting / Prefix / Scan | 36.4% | 50.0% | all |
| 234 | Palindrome Linked List | Easy | Strings; Linked List | Hashing / Sliding Window; Two Pointers | 58.0% | 50.0% | all |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 50.0% | all |
| 169 | Majority Element | Easy | Core DSA | Implementation / Reasoning | 66.3% | 50.0% | all |
| 907 | Sum of Subarray Minimums | Medium | Arrays | Sorting / Prefix / Scan | 38.6% | 50.0% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 50.0% | all |