Marshall Wace · OA → Phone screen → Onsite
In processMarshall Wace Older Quant Tests: 5 Experiences (Part 3 of 3)
Marshall Wace coding tests and interviews from 2019 to 2021: five older reports with string and array tasks, a rotated-squares phone question and LCS.
At a glance
- Process (older reports): a timed coding test of two to five tasks (two in 100 minutes in H16), a technical phone interview (H17) and onsite rounds (H18, H19).
- Asked in this period: array and string tasks with large inputs (H15, H16), counting squares in any orientation (H17), longest common subsequence on paper (H18), and a "what happens when you search" explanation (H19).
- Difficulty: one candidate failed after a low-level slip in the second task (H16); another failed the phone round (H17).
- Note: every report here is from 2019–2021, so this part is History and sits outside current counts. For the current Quant Associate process, see Part 1.
Coverage: Records H15–H18 of the 18-record Marshall Wace series (June 2019 to February 2021): a quant candidate, a software engineering intern and two with role unstated, plus one more firsthand London onsite report from July 2020 (H19, role not stated). Questions shared online without a candidate report are listed separately at the end.
In this series
- Part 1: the overview, the 18-question probability paper for Quant Associates and records 01–03.
- Part 2: records 04–14, September 2022 to October 2025: DP coding tasks, early screens and data roles.
- Part 3 (current): records H15–H19 from 2019–2021, plus unconfirmed question leads.
History (before Nov 2023)
H15: Four photographed tasks and a fifth named one
Report date: February 9, 2021 · Role: Not stated
- Even letter frequencies: a word is even when every letter appears an even number of times. Delete the fewest letters from lowercase
S(length 0 to 200,000) to make it even:acbcbba -> 1,axxaxa -> 2,aaaa -> 0. The candidate's photographed code wrongly returned early for a one-character string, which needs one deletion. - Distinct integers summing to zero: return any
Ndistinct integers (1 <= N <= 100) that sum to zero, e.g.[1,0,-3,2]or[-2,1,-4,5]forN = 4;[1,-1,1,3]fails because it repeats1. - Binary reduction: a big-endian binary string (up to 1,000,000 bits, leading zeros allowed) is a number; subtract 1 if odd, halve if even, until zero, and count the steps.
011100 -> 7,111 -> 5,1111_0101_0111_1 -> 22(underscores only group the bits), and 400,000 ones give 799,999. - Two frogs: both frogs start on one chosen block and may move to neighbors of the same or greater height. If they end at
J <= K, the distance isK - J + 1; pick the start that maximizes it.[2,6,8,5] -> 3,[1,5,5,2,6] -> 4,[1,1] -> 2; 2 to 200,000 blocks, heights up to10^9. The candidate scanned outward from every start, which is quadratic in the worst case. - A fifth task the candidate identified as Battleship. The original wording is not confirmed; Battleship Reconstruction counts sunk and damaged ships from corner coordinates and shots as a practice version.
H16: Two quant coding tasks in 100 minutes
Report date: October 17, 2019 · Role: Quant · Result: Fail
- Minimum winning rounds: John starts with one chip and wins every round, either betting one chip (+1) or going all-in (×2). Given final total
N(up to 2,147,483,647) and at mostKall-ins (up to 100), return the fewest rounds.N = 8, K = 0 -> 7;N = 18, K = 2 -> 6;N = 10, K = 10 -> 4. - Two apple segments: Alice takes
Kconsecutive trees and BobL, without overlap. Return the largest total modulo10^9 + 7(maximize first), or-1if impossible.[6,1,4,6,3,2,7,4], K = 3, L = 2 -> 24;[10,19,15], K = 2, L = 2 -> -1.2 <= N <= 100,000, values up to10^9. - The candidate said a low-level mistake in the second task caused the rejection.
H17: Counting rotated squares on the phone
Report date: October 15, 2019 · Stage: Technical phone · Role: Not stated · Result: Fail
- Why Marshall Wace?
- Given points
(x, y), count the squares whose four corners are among them. The squares need not be axis-aligned. Bounds, duplicates and examples were not shared.
H18: LCS on paper at the onsite
Report date: June 23, 2019 · Role: Software Engineering Intern · Stage: Onsite
- The longest common subsequence, written as pseudocode on paper in any language.
- After about 45 minutes, the interviewer came back and asked the candidate to explain the code.
H19: What happens when you search your name
Report date: July 29, 2020 · Stage: Onsite · Location: London · Role: Not stated
- Explain in detail what happens when you type your name into a web search engine. The answer and any follow-ups were not shared.
Questions shared without a candidate report
These were posted or circulated as Marshall Wace questions, but no candidate described being asked them, so they are not counted above.
- Bayesian paternity (practice question, October 2024): a judge starts at 0.5, hears testimony on day one, then learns the child's blood type is B, with P(B | father) = 0.5 and P(B | not father) = 0.1, ending at 0.75. What was the probability after day one? The poster solved
0.75 = 0.5p / (0.5p + 0.1(1 - p))to getp = 3/8. Possible further parts: the likelihood ratio of the testimony, and a revised answer when P(B | not father) is uniform between 0.1 and 0.2. - Design London's Oyster travel-card system (May 2020): the poster came across it; they did not say they were asked it.
- Older test leads, unconfirmed: aircraft moving between London and New York (105 planes, 70 and 35 at the start; each month 60% of London's stay and all of New York's move to London; counts after
Tmonths and in the limit); paint a 10×10×10 cube and count unit cubes with paint; extract a signal from analyst sentiment data; a Markov-chain word problem; how you calculate fair value (data, model, time frame); a 20-question exam on probability, statistics, regression, linear algebra, calculus and brainteasers; the smallest integer whose digits multiply to 10,000; robot paths on a 5×5 grid with a blocked square; the variance of a uniform variable; the trace of a matrix exponential; and the chance 51 coins show more heads than 50. - Behavioral headlines: interest in technology, a big challenge, why the company, and team conflict, matching an early software screen reported in the series.
- ELEVATE programme (July 2023): a separate fundamental-investing track whose invitation involved financial-statement modelling and a presentation.
Patterns across the reports
- Large-input array and string tasks. H15 and H16 both gave inputs up to 100,000–1,000,000 elements with worked examples, where a quadratic approach (H15's frog scan) would be too slow.
- Explaining your own code. H18 had to explain its paper solution, and H15's photographed code showed an edge-case bug.
Common questions
What did the Marshall Wace coding test look like in 2019–2021?
Two tasks in 100 minutes for a quant candidate (H16) and four or five tasks in another sitting (H15), all array or string problems with large inputs.
Does Marshall Wace ask "why Marshall Wace"?
Yes, in the H17 phone interview, before the coding question.
Keep practicing
- From H15: Even Letter Deletions, Distinct Zero-Sum Array, Binary Reduction Steps, Frog Separation and Battleship Reconstruction.
- From H16–H18: Limited All-In Rounds, Two Apple Segments, Count Squares in Any Orientation and Longest Common Subsequence.
- Marshall Wace coding question bank: every Marshall Wace coding problem (sign-in needed).
- Marshall Wace hiring insights: the stages and recent hiring signals.
- Experience feed: more interview reports from other companies and roles.
In this series: Part 1 · Part 2 · Part 3 (current)
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.