PRACTICE GUIDE MARSHALL WACE
Marshall Wace Quant Developer: what the test is, and how to train for it
Marshall Wace does not publish the shape of its quant developer screen, and candidates describe it as 2 to 4 problems questions in 60 to 120 minutes, roughly 20 to 40 minutes per question, written in a code editor and run against tests you cannot see.
Those are ranges across firms running this format rather than Marshall Wace's own figures, so treat them as the shape to train against and check the instruction screen on the day for the marking rule.
Outcry is not affiliated with Marshall Wace and has no access to their assessment content. This guide describes an assessment format that candidates report publicly; the questions here are generated by Outcry and are not Marshall Wace’s own.
What it screens
A London-based global hedge fund known for TOPS, its systematic long/short equity platform.
- ✓Reading concurrent code and pointing at the defective line
- ✓Order-book data structures: what happens on a cross, a cancel, a partial fill
- ✓Algorithmic complexity chosen for the input sizes stated in the problem
- ✓Monte Carlo methods and when a simulation beats a closed form
Where it sits at Marshall Wace
A London-based global hedge fund known for TOPS, its systematic long/short equity platform. What that means for the screen is that the questions tend to be drawn from the work rather than from a textbook, so the format below is the shape to train against rather than a syllabus.
Candidates also report one other screen at Marshall Wace, covered separately on this site. Where a firm runs several, they usually sit in one round rather than spread across the process, so the pacing of the whole set matters more than any single section.
The format
Marshall Wace does not publish this screen's shape, and it varies between firms, so these are the ranges candidates report rather than exact figures.
| Questions | 2 to 4 problems |
|---|---|
| Time | 60 to 120 minutes |
| Per question | 20 to 40 minutes |
| Negative marking | No |
| Answer style | Code editor, run against hidden tests |
| Where it sits | First technical round, usually on HackerRank or CoderPad |
What it tests, with a worked example
Every example below is generated by Outcry, drawn from the same question generators the timed drills run. None of them is Marshall Wace’s.
Data structure implementation
Build the thing rather than call it: an order book, a cache, a ring buffer. Graded by hidden tests, so there is no partial credit for an approach.
Complexity that is actually graded
Hidden tests sized so the naive solution times out. A correct answer that is too slow scores the same as a wrong one.
Reading someone else's code
A diff or a function with a bug in it, and the question is where.
Example
A lock-free SPSC ring buffer publishes its head index with memory_order_relaxed. What can go wrong?
- The index can wrap incorrectly
- The consumer may see the new index before the slot's data is visible
- The producer may block
- Nothing - SPSC needs no ordering
Answer The consumer may see the new index before the slot's data is visible
The publishing store needs release semantics to pair with the consumer's acquire load, or the buffer write can be reordered after it.
Edge cases
Empty input, one element, duplicates and overflow. The hidden tests always include them.
Statistics in code
Rolling windows, correlations and quantiles, implemented rather than imported.
Example
A strategy has a daily Sharpe ratio of 0.1. What is the annualised Sharpe, using 252 trading days?
- 25.2
- 1.2
- 1.59
- 0.1
Answer 1.59
Mean scales with the number of days and standard deviation with its square root, so the ratio scales with √252 ≈ 15.87: 0.1 × 15.87 = 1.59. Multiplying by 252 scales the numerator only and overstates the ratio by a factor of 15.87.
Probability behind the problem
Screens that look like coding questions and are really expectation questions.
Example
f(x) = 2x + 284/x for x > 0. What is the minimum value of f?
- 286.00
- 11.92
- 47.67
- 23.83
Answer 47.67
f'(x) = 2 - 284/x^2 is zero at x = sqrt(284/2) = 11.92, where both terms equal sqrt(568). So the minimum is 2 sqrt(2 x 284) = 2 sqrt(568) = 47.67. AM-GM gets there without differentiating.
What a good score looks like
Coding screens are usually pass-fail on hidden tests rather than scored, and candidates commonly report that a solution passing every correctness test still fails on a timeout. Treat full marks as solving every problem inside the complexity bound, not merely solving it.
How to train for it
- 01State the complexity before you write. If it is worse than the input size allows, the approach is already wrong.
- 02Write the edge cases into your own tests first. That is where the hidden ones live.
- 03Practise without an autocomplete. The screens run in a bare editor, and the gap between writing code with help and without it is larger than most people expect.
TRAIN IT HERE
The drills that match each section
Concurrency Clash
Find the data race, name the fix - real C++ defect patterns, five levels.
Order Book
Matching-engine mechanics: crosses, cancels and partial fills.
Algorithm Lab
DP tables, Monte Carlo estimation and speed rounds at four difficulty tiers.
SIT THE FULL BATTERY
All the sections back to back on one clock, marked the way the real screen marks them, with a by-skill breakdown at the end. Included with any pass.
Also reported at Marshall Wace
Common questions
- Is the Marshall Wace quant developer test multiple choice?
- Reported as code editor, run against hidden tests. Formats move, so treat this as the shape rather than a guarantee.
- How long is the Marshall Wace quant developer test?
- Candidates report 2 to 4 problems questions in 60 to 120 minutes, roughly 20 to 40 minutes per question.
- Is there negative marking on the Marshall Wace quant developer test?
- No. A wrong answer costs nothing beyond the mark you would have earned, so leaving an item blank is never better than guessing at it.
- How do I practise for it free?
- Every drill linked on this page is free to play, with no account, inside a daily run cap. Questions are generated fresh each run, so there is nothing to memorise between attempts.