Morgan Stanley · OA → Phone screen → Onsite
In processMorgan Stanley Apprenticeship and Tech Interviews: 6 Experiences
Morgan Stanley technology apprenticeship hiring in 2026 used a timed test of debugging, aptitude and three coding tasks, then two 50-minute interviews.
At a glance
- Process (apprenticeship, 2026): online assessment (about two hours: 7 debugging tasks, 24 interactive aptitude questions, 3 coding tasks) → a 50-minute technical interview → a 50-minute final with a senior director (entries 01, 02).
- Asked recently: array and DP coding in the test, such as nonadjacent ratings and a Delete and Earn variant; interval, second-largest and run-length tasks live (entry 01); a library OOP design for one Calgary candidate (entry 03).
- Difficulty: neither apprenticeship report rated difficulty; the 2026 test was tightly timed (15 minutes for the debugging section, entry 02).
- Practise first: minimum resources for overlapping intervals, run-length encoding and interleave array halves.
Coverage: 2 Technology Apprenticeship reports (2027 batch, India, 2026) and 4 technology reports whose employment type was not stated (Calgary 2025; United States 2023; two older Indian campus drives). Reports from 2023 and earlier sit in History.
Sections: Technology Apprenticeship (2 reports) · Hiring level not reported (1 current report, 3 in History). The groups are counted separately.
Technology Apprenticeship (2 reports)
What came up
Both apprenticeship candidates described the same test layout: seven debugging tasks, 24 interactive aptitude questions and three coding tasks. Only entry 01 went on to interviews, which mixed live coding with a deep project discussion.
| Topic | Reports | Last seen |
|---|---|---|
| Timed test: debugging, aptitude, coding | 2 of 2 | May 2026 |
| Array and DP coding tasks | 2 of 2 | May 2026 |
| Project deep dive (microservices, Kafka) | 1 of 2 | May 2026 |
| Teamwork and leadership questions | 1 of 2 | May 2026 |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Minimum resources for overlapping intervals | 1 | May 2026 |
| Second-largest array element | 1 | May 2026 |
| Run-length encoding | 1 | May 2026 |
| Maximum total of nonadjacent ratings | 1 | Apr 2026 |
| Interleave array halves | 1 | Apr 2026 (report date) |
| Delete and Earn variant | 1 | Apr 2026 (report date) |
| Count shipment schedules | 1 | Apr 2026 (report date) |
Behavioral (BQ)
| Question | Reports | Last seen |
|---|---|---|
| How did you divide work, handle disagreements, meet deadlines and help teammates? | 1 | May 2026 |
Project and data questions
| Question | Reports | Last seen |
|---|---|---|
| Why you started programming and why you built your project | 1 | May 2026 |
| Microservices, Kafka, partial failure, transactions and service discovery in your project | 1 | May 2026 |
| How would you group records by user with no user identifier? | 1 | May 2026 |
2 detailed candidate timelines
01: two 50-minute conversations and an offer
Interview date: test April 2026, interviews May 2026, offer June 2026 · Role: Technology Apprenticeship, 2027 batch · Location: India · Result: Offer
Online assessment (about two hours)
- Seven debugging tasks (Java, C++ or Python), 24 interactive aptitude questions and three coding tasks.
- One coding task was array manipulation and another a sliding-window problem; their full objectives were not given. The one that can be identified was choosing nonadjacent ratings to maximize the total score.
First interview (about 50 minutes)
- The interviewer had already looked at the candidate's programming work, so there was no standard introduction. It opened with how they got into programming and why they built their project.
- Coding: the minimum resources needed for overlapping intervals, the second-largest element in an array, and run-length encoding, where
AAAABBCCbecomesA4B2C2. The candidate explained brute force first, then improved the interval and encoding solutions. - On the second-largest task they asked whether duplicates meant the second distinct value or the second occurrence; the interviewer's answer was not given.
- A data question: how to group records by user when the data has no user identifier. The candidate pointed out the missing information, and the interviewer agreed.
Final interview (about 50 minutes, a senior director)
- A deep dive on the candidate's Spring Boot microservices project: why microservices and Kafka, what happens when one service fails, how database transactions work, and how the Eureka clients, server and service discovery fit together.
- A hackathon leadership story: dividing work, disagreements, deadlines and helping teammates.
The candidate said eight of the nineteen students first shortlisted at their campus got offers.
02: a tightly timed test for the 2027 batch
Cycle: 2027 batch · Report date: April 2026 · Location: VIT Pune, India · Stage: Online assessment · Result: Not described
Online assessment (111 minutes in three sections)
- Debugging: seven short C++, Java or Python programs in 15 minutes.
- Aptitude: 24 interactive questions in 36 minutes, covering scheduling, graphs, adjusting a line chart and reasoning.
- Coding, three tasks in 60 minutes:
- Interleave the two halves of an even-length array, keeping the order inside each half and allowing duplicates. One input was
[4,4,4,4,8,3,5,9]. - A Delete and Earn variant: pick
x, gainx, remove that value and everyx-1andx+1, and repeat. The example input was[8,3,4,2,2,7]with no expected answer. The statement claimed every selection order gives the same score, which is not true in general, so that part stays unclear. - Count the ways to turn exactly k zeros into ones in a shipment string. For
n=7, bits[1,0,1,0,1,0,0]andk=3, there were four choices.
- Interleave the two halves of an even-length array, keeping the order inside each half and allowing duplicates. One input was
Hiring level not reported (1 current report)
What came up
The one current report in this group, from Calgary, paired data-structure comparisons and a small coding task with an object-oriented library design.
Questions we found
Low-Level Design (LLD/OOD)
| Question | Reports | Last seen |
|---|---|---|
| Design a library system with OOP | 1 | Nov 2025 |
CS fundamentals and projects
| Question | Reports | Last seen |
|---|---|---|
| Compare arrays with linked lists, and trees with hash maps | 1 | Nov 2025 |
| A research collaboration, and how you tested a startup's MVP | 1 | Nov 2025 |
| What challenges did your research project involve? | 1 | Nov 2025 |
1 detailed candidate timeline
03: Calgary interviews on testing, research and a library model
Interview date: late November 2025 (applied late September; offer early December) · Location: Calgary, Canada · Level: not stated · Result: Offer
Technical interview 1 (testing and AI focus)
- A school research collaboration, and how the candidate tested a startup's minimum viable product.
- Compare arrays with linked lists, and trees with hash maps.
- One easy coding task; its objective was not shared.
Technical interview 2 (an OOP developer)
- What was hard about the research project.
- Design a library system using object-oriented principles.
Common questions
What is on the Morgan Stanley apprenticeship online assessment?
Both 2026 reports describe seven debugging tasks, 24 interactive aptitude questions and three coding tasks (entries 01, 02). Entry 02 gave the timing: 15, 36 and 60 minutes, 111 in all; entry 01 called it about two hours.
How many interviews does the Morgan Stanley apprenticeship have?
In the one report that reached interviews, two rounds of about 50 minutes: a technical interview and a final with a senior director, then an offer in June (entry 01).
What coding questions does Morgan Stanley ask apprentices?
Arrays, intervals and DP: interleaving array halves, a Delete and Earn variant and counting shipment schedules in the test (entry 02); overlapping intervals, second-largest element and run-length encoding live (entry 01).
Does the Morgan Stanley apprenticeship interview ask about projects?
Yes, in entry 01 both interviews did: why the project was built, and a deep dive on its microservices, Kafka, failures, transactions and service discovery.
History (before 2024)
These reports are more than three years old, or undated campus drives, and the employment type was not stated. They stay out of the counts and tables above.
H01: a U.S. analyst loop that pushed past the first solution
Interview date: July 2023 · Role: Technology Analyst · Location: United States · Result: Not described
Before the interviews
- Recruiter outreach, a careers application, a recorded interview with four behavioral questions, an information session, and a 90-minute test of aptitude, debugging and three scenario-based coding questions. The candidate fully solved two and missed two hidden cases on the third.
First interview
- Project architecture and stack, leading into SOLID, ACID, publish-subscribe and consistent hashing.
- A task like an LFU cache, built on the candidate's earlier LRU work. The interviewer gave three cases, and the dry runs matched.
- A task resembling Count the Number of Ideal Arrays. A recursive attempt was too slow; after a math hint the candidate tried DP but was not fully happy with it.
Second interview
- Distinct, non-overlapping palindrome partitions, then a version with a fixed partition length
p, with complexity and dry runs on the interviewer's cases. - C++: struct and union memory, pure virtual and friend functions, and
voidversusNULL. - Generic HR questions.
H02: a campus loop with an Employee class and a shopping database
Report date: 2015 · Background: MCA campus candidate · Location: India · Result: Not described
Assessment (90 minutes: 19 multiple-choice questions, two coding tasks)
- Positive integers whose binary form has no consecutive ones. The bound was unclear: the wording said up to
2^N, but the example forN=15listed1,2,4,5,8,9,10, which fits an upper bound ofN. - Maximize the meetings attended, given start times and durations.
Technical interview (about 75 minutes)
- Maximum sum of a contiguous, strictly increasing subarray in O(n); for
[7,1,5,8,2,5,6]the answer is14. - A node's level in an N-ary tree, returning
-1if it is absent. - Detect and remove a cycle in a singly linked list.
- Implement a random-number generator; the candidate could not give a working answer, and the distribution asked for was not described.
- Print every binary-tree node at distance k from a given node.
- An Employee class that requires a username and blocks changing the date of birth once it is set.
- Merge sort, quicksort and pivot choice; processes and threads with real examples; normalization versus denormalization.
HR, group activity and database design
- A 20–30-minute HR round: introduce yourself, strengths and weaknesses, what you are proud of, leadership, innovation, challenges and expectations.
- A group activity: pitch a LEGO startup to investors.
- A one-hour online-shopping database design with follow-ups on relationships, concurrency, transactions, ACID and synchronization.
- A final 30-minute HR talk: what you learned from the interviews, extracurriculars, teamwork, projects, and why the firm should hire you.
H03: a December campus test with three coding problems
Report date: 2014 (exact interview year not given) · Location: India · Result: Not described
Written test (90 minutes: three coding questions, 30 objective questions on C, C++, program output and reasoning)
- Count array pairs that sum to k.
- Maximize the value of n by exchanging it for floor(n/2), floor(n/3) and floor(n/4), or keeping it;
12gives13. - Find the earliest date written as day, three-letter month and year; from
13 Jan 2014,24 Dec 1994and08 Feb 2000the answer is24 Dec 1994.
Keep practicing
- Apprenticeship test and interview tasks: nonadjacent ratings, overlapping intervals, second-largest element and run-length encoding (entry 01); interleave array halves, Delete and Earn variant and shipment schedules (entry 02).
- Design: the library system from entry 03.
- Older tasks from History: LFU cache, ideal arrays and palindrome partitions (H01); no consecutive ones, maximum meetings, increasing subarray sum, N-ary tree level, list cycle, number generator, nodes at distance k, the Employee class and the shopping database (H02); target-sum pairs, coin exchange and earliest date (H03).
- Morgan Stanley question banks: algorithms and system design (sign-in needed).
- Everything Morgan Stanley in one place: the Morgan Stanley interview page.
- More firsthand reports: the Experience feed.
Morgan Stanley experiences by role
- Internships (25 experiences): Part 1, 2024–2026 · Part 2, 2023–2024 · Part 3, 2022–2023 · Part 4, 2021–2022 · Part 5, 2016 and 2020–2021
- New grad and full-time, 2014 and 2018
- Apprenticeship and level not reported (current)
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.