Assessment tips
- Confirm the current Morgan Stanley pattern from the drive mail before practising old papers
- Finish one problem or section fully before starting the next
- Revise the fundamentals listed in the round table on this page
How Morgan Stanley Technology Analyst and campus tech loops actually run, synthesized from recent candidate reports and Morgan Stanley public hiring guides. We reorganized rounds and added prep notes. Some India drives compress phone screen and HireVue; investment-banking Superdays differ from technology Superdays - treat your drive mail as source of truth.
Reported fresher Technology Analyst total compensation in India commonly falls in the ₹25–35 LPA band (candidate-reported) - confirm on your offer letter. Eligibility often cited: ~7.0+ CGPA, no active backlogs across 10th, 12th, and graduation.
| Round | Duration | What it tests |
|---|---|---|
| Timed coding test | 60–90 min (sometimes 90–120) | 2–3 HackerRank/Codility problems + quant/aptitude on many campus drives |
| Phone screen | ~30 min | Resume, why finance/why MS, light technical |
| HireVue video interview | 48–72 hrs to complete | 3–5 recorded behavioral prompts; content scored, not facial AI |
| Superday | 4–5 × 30–45 min | DSA, trading/risk system design, behavioral fit, hiring manager |
Profile: B.Tech CS, ~8.5 CGPA, two fintech internships, strong system-design prep
Timed coding test
Phone screen
HireVue
Superday (virtual, 5 sessions)
Result: Selected. Reported ~₹32 LPA Technology Analyst (candidate-reported, Mumbai).
Takeaways
Profile: B.Tech IT from NIT, ~8.0 CGPA, ~1 year backend experience
Timed coding test
HireVue (phone screen skipped for this candidate)
Superday
Result: Selected. Reported ~₹28 LPA (candidate-reported, Bangalore).
Takeaways
Profile: B.Tech ECE, ~7.2 CGPA, strong DSA, weak structured speaking
Timed coding test
HireVue
Result: Rejected before Superday - no technical rounds. Takeaway: Public reports emphasize HireVue as a real filter for technology campus tracks; rehearse timed 2-minute STAR recordings, not only LeetCode.
Profile: B.Tech CSE, ~7.8 CGPA, summer intern in operations technology
Internship
FTE loop (shortened)
Result: FTE offer at intern band uplift; candidate-reported package in high-20s LPA (confirm offer letter). Takeaway: Intern return offers still test markets vocabulary - know inputs/outputs of market-data feeds in plain language.
Profile: B.Tech CS, ~8.1 CGPA, 300+ LeetCode problems
Through HireVue
Superday
Result: Rejected post-Superday. Takeaway: MS technology Superday is not LeetCode-only - client/regulatory framing and authentic finance motivation decide borderline cases.
| Stage | What to verify | Common miss |
|---|---|---|
| OA | HackerRank link, aptitude section, camera/proctor rules | Starting coding before reading full quant section |
| HireVue | Deadline (48–72h), quiet room, full STAR answers | 20-second replies and retake fatigue |
| Superday | Schedule, interviewers’ titles, virtual whiteboard tool | No story for “why finance” |
| Compliance | Background check documents, gap explanations | Surprises in HR after strong tech |
After Superday, a short HR or offer call covers logistics, compensation bands, and start dates. Deeper STAR prep lives on the dedicated HR page - keep motivation consistent with HireVue and Superday.
Use these as frames, not scripts - interviewers probe follow-ups.
Q. How do you find the Longest Increasing Subsequence efficiently?
A. The classic dynamic-programming solution defines dp[i] as the length of the longest increasing subsequence ending at index i, computed by scanning all earlier indices with a smaller value and taking the best plus one - that is O(n squared) time and O(n) space. The optimal solution is patience sorting: maintain an array tails where tails[k] is the smallest possible tail value of an increasing subsequence of length k+1. For each element, binary search for the first tail that is greater than or equal to it and overwrite it, or append if the element exceeds every tail. The length of tails is the answer, giving O(n log n) time. Note that tails is not itself a valid subsequence - to reconstruct the actual sequence you must store predecessor indices alongside.
Q. How do you design an LRU cache with O(1) get and put?
A. Combine a hash map with a doubly linked list. The hash map maps key to node, giving O(1) lookup; the doubly linked list keeps nodes in recency order with the most recently used at the head and the least recently used at the tail. On get, find the node through the map and move it to the head. On put, either update and move to the head, or insert a new node at the head and, if capacity is exceeded, remove the tail node and delete its key from the map. A doubly linked list is required because eviction and re-linking need O(1) access to a node’s predecessor, which a singly linked list cannot give. Sentinel head and tail nodes remove most of the null-handling edge cases, and in production you would also need locking or a concurrent variant since a cache is shared across threads.
Q. How would you design a low-latency order matching engine?
A. Keep the whole book in memory and avoid anything that touches disk on the hot path. Model each side of the book as a price-ordered structure - typically a sorted map, or an array of price levels for the tight range around the touch - where each price level holds a FIFO queue of resting orders, so matching follows price-time priority: best price first, and within a price, the earliest order first. An incoming aggressive order walks the opposite side from the best price, filling against resting orders until its limit price is passed or its quantity is exhausted; the remainder rests in the book. Keep a hash map from order id to its node so a cancel is O(1) rather than a scan. Single-threaded matching per instrument fed by a lock-free ring buffer usually beats a multi-threaded design because it removes lock contention and keeps the book in cache; durability comes from writing the input event stream to a replicated journal before matching, so state can be rebuilt by replay.
Assessment tips
Interview tips
HR tips
Round-wise notes on this page are curated from public candidate reports, then reorganized with prep takeaways and outcome context (GeeksforGeeks, Glassdoor, placement forums) and Morgan Stanley’s published interview preparation guidance. Cross-check the current drive mail for timings. For OA practice, see Morgan Stanley placement papers.
Goldman Sachs · JP Morgan · Bank of America · Wells Fargo · HSBC · Barclays