RepostedMarshall Wace logo

Marshall Wace · OA → Phone screen → Onsite

In process

Marshall Wace Coding Tests: 11 Experiences (Part 2 of 3)

Quant (general) · UnknownOct 2025
Shared byjanebeingjane

Marshall Wace quant and tech coding reports, 2022–2025: three-task tests on strings, arrays and grids, ordered letter cases seen twice, plus early screens.

At a glance

  • Process: timed coding tests of about three tasks (80 minutes in 04, 70 minutes with SQL, multiple choice and debugging in 06), a technical phone round with coding (05) and early screens on motivation and projects (07, 09).
  • Asked recently: string tasks in 4 of 7 current reports (04, 08, 09, 10) and array or window tasks in 4 (04, 05, 06, 08). Ordered letter cases is the only repeat (04, 10).
  • Difficulty: one quant summer candidate called the tasks mainly dynamic programming and failed (04); a tech intern passed the test but not the next interview (06); a data engineer was rejected after the early screen (09).
  • Practise first: Ordered Letter Cases, Remove Consecutive Shelves and Company Email Addresses.

Coverage: Quant summer and tech internships, data engineers (one with eight years' experience, one senior), a software engineering summer intern and several unstated roles. Coding tests, a technical phone round and early screens; UK where stated. Current reports January 2024 to October 2025; four reports from September 2022 to July 2023 are under History.

In this series

  • Part 1: the overview, the 18-question probability paper for Quant Associates and records 01–03.
  • Part 2 (current): records 04–H14, September 2022 to October 2025: DP coding tasks, early screens and data roles.
  • Part 3: records H15–H19 from 2019–2021, plus unconfirmed question leads.

What came up

Nearly every current report here is a coding test of short, exact-output tasks on strings and arrays, each with worked examples. Counts cover the 7 current reports (04–10).

Topic Reports Last seen
Coding tasks 6 of 7 Oct 2025
String manipulation 4 of 7 Oct 2025
Arrays, subarrays and windows 4 of 7 Oct 2025
Behavioral and motivation 2 of 7 Feb 2025
Matrices and grids 2 of 7 Oct 2025
Debugging given code 2 of 7 Sep 2025
Geometry 1 of 7 Apr 2024
SQL 1 of 7 Aug 2025

A candidate can appear in more than one row. Dates are report dates, except 10, which uses the interview date the author gave.

Questions we found

Algorithms / Data Structures

Question Reports Last seen
Ordered letter cases 2 Oct 2025
Shortest subarray covering L..R 1 Oct 2025
Trailing zeros on a one-turn path 1 Oct 2025
Minimum full glasses 1 Sep 2025
Fix a smallest-difference function (practice) 1 Sep 2025
Three two-element tiles 1 Sep 2025
Most events in a 60-second window 1 Aug 2025
Remove consecutive shelves 1 Nov 2024
Erase equal-letter pairs 1 Nov 2024
Company email addresses 1 Apr 2024
Distinct tags in a circle (practice) 1 Apr 2024
Two-row binary matrix 1 Apr 2024
Crop a notification 1 Jan 2024
Largest palindromic number 1 Jan 2024

SQL

Question Reports Last seen
Successful logins from two or more countries 1 Aug 2025

Behavioral (BQ)

Question Reports Last seen
What does the company do / what do you know about it? 2 Feb 2025
Why Marshall Wace? 1 Feb 2025
Why technology, and which parts interest you? 1 Feb 2025
Describe a previous project and why you chose it 1 Feb 2025
Describe a conflict in a team 1 Feb 2025
Describe a big challenge 1 Feb 2025
Introduce yourself 1 Apr 2024
Which project are you proudest of? 1 Apr 2024
Why are you changing jobs? 1 Apr 2024
What is your ideal working environment? 1 Apr 2024
What new technology interests you? 1 Apr 2024

7 detailed candidate timelines, loops, and screens

04: Three tasks in 80 minutes for a quant summer role

Report date: Oct 1, 2025 · Role: Quant QA (summer application) · Location: UK · Result: Fail

Three tasks in 80 minutes, which the candidate called mainly dynamic programming.

  1. Ordered letter cases: count letters that appear in both cases with every lowercase occurrence before every uppercase one. aaAbcCABBc gives 2 (a and b).
  2. Cover an integer range: the shortest consecutive fragment of A containing every integer from L to R, or -1.
  3. Trailing zeros on a path: a path through a positive-integer matrix may start and end anywhere and turn at most once; maximize the trailing zeros of the product of its cells.

No size bounds or full signatures were given.


05: Glasses, a buggy function and three tiles

Report date: Sep 22, 2025 · Role: Quant Summer · Location: UK · Stage: Technical phone interview

  1. Full glasses: one glass of each capacity 1..N, each full or empty; the fewest glasses that hold exactly K litres, or -1. Interface solution(N, K).
  2. Find and fix the bugs in a function meant to return the smallest difference between any two integers in an array, not only neighbours. The faulty code was not shared, so the practice version is a reconstruction.
  3. Three two-element tiles: place up to three non-overlapping tiles, each covering two neighbours in A, to maximize the covered sum. The printed signature was garbled and no bounds were given.

06: SQL, a time window and an unfamiliar language

Report date: Aug 13, 2025 · Role: Tech Intern · Result: Passed the 70-minute assessment, then failed the early interview

The test mixed data handling, coding, SQL, multiple choice and debugging in an unfamiliar language. Two tasks were readable:

  1. Successful logins across countries: from login_attempts(user_id, timestamp, status, country), return user_id for users with a SUCCESS login in at least two distinct countries, sorted alphabetically.
  2. Event window: from sorted timestamps in seconds, the most events in any 60-second window. How endpoints count was not stated.

The debugging code and the multiple-choice questions were not shared.


07: Seven early-screen questions

Report date: Feb 12, 2025 · Role: Not stated (filed under a software internship)

  1. Why Marshall Wace? Why technology, and which parts of it interest you?
  2. What does the company do?
  3. Describe a previous project and why you chose it.
  4. Describe a conflict in a team, and a big challenge.

08: Shelves and pair deletion

Report date: Nov 10, 2024 · Role: Not stated

Screenshots showed tasks two and three; the first was missing.

  1. Remove consecutive shelves: remove exactly R consecutive shelves to keep the most distinct item types elsewhere. [2,1,2,3,2,2], R = 3 gives 2; [1,100000,1], R = 3 gives 0. N up to 100,000; solution(A, R).
  2. Delete matching pairs: delete any pairs of identical uppercase letters, keeping the order of the rest; return the shortest result, then the lexicographically smallest. CBCAAXA gives BAX; ABCBACDDAA gives the empty string. Length up to 100,000. Sorting the odd-count letters would break the order.

09: A data engineer's test and screen

Report date: Apr 23, 2024 · Role: Data Engineer (eight years' experience) · Result: Rejected after early screening

First coding assessment (graded on correctness, not performance):

  1. Email generation: from ; -separated names and company C, build first.last, then @, the company name and .com, all lowercase, ignoring middle names, removing surname hyphens and keeping at most 8 surname letters; collisions get 2, 3, … before @. Output Name <email> in input order. Mary Jane Watson-Parker becomes mary.watsonpa; a second John … Doe becomes john.doe2.
  2. Tagged points in a circle: count differently tagged points within a circle of given radius. Centre, boundary and repeat rules were not recalled; it may or may not be the same task as H12's circle.
  3. Two-row binary matrix: from upper sum U, lower sum L and column sums in {0,1,2}, return any valid matrix as upper,lower, or IMPOSSIBLE. U = 3, L = 2, C = [2,1,1,0,1] allows 11001,10100.

Early screen: introduce yourself, your proudest project, why change jobs, your ideal environment, what you know about the company, and a new technology that interests you.


10: Letter cases, notifications and palindromes

Interview date: Jan 14, 2024 · Report date: Jan 13, 2024 (as written) · Role: Not stated

  1. Ordered letter cases again: abcABC -> 3, abABCdef -> 2, abcABCabc -> 0.
  2. Crop a notification: if the message exceeds K characters, drop whole words from the end and add ..., which counts toward K; return ... alone if no word fits, with no trailing space. And now here is my secret, K = 15 gives And now ....
  3. Largest palindromic number: use some digits of S in any order to form the largest palindrome, no leading zeros except 0 itself. 8199 -> 989, 00900 -> 9, 000 -> 0. Length up to 100,000.

History (before November 2023)

H11: Frogs, palindromes and a digit sum

Report date: Jul 23, 2023 · Role: Data Engineer · Stage: Technical phone interview

  1. Two frogs: frogs jump left or right to adjacent higher blocks; find their greatest separation. The wording said "after one jump"; starting positions and distance were not given, so it may differ from the repeated-jump version in H12 and H15.
  2. Rearrange into a palindrome: the fewest deletions so the rest can be rearranged into a palindrome.
  3. Twice the digit sum: the smallest number whose digit sum is twice the input's. 14 -> 19, 10 -> 11, 99 -> 9999; "larger than the input" is read from the 10 -> 11 example.

H12: Soldiers, a tagged circle and frogs

Report date: Feb 19, 2023 · Role: Senior Data Engineer

Three tasks; the second did not pass every test before time ran out.

  1. Soldiers: count soldiers who have someone exactly one rank higher. [3,4,3,0,2,2,3,0,0] -> 5, [4,2,0] -> 0. The candidate counted each rank and added its frequency when the next rank existed.
  2. Tagged circle: choose an origin-centred circle (boundary counts as inside) holding the most points with no repeated tag. S = ABDCA, X = [2,-1,-4,-3,3], Y = [2,-2,4,1,-3] gives 3. solution(S, X, Y).
  3. Frogs: the same frog task as H15 in Part 3, per the author.

H13: A phone screen before a coding test

Report date: Nov 15, 2022 · Role: Not stated

  1. Six questions: introduce yourself, describe a project, why technology, your favourite project, why Marshall Wace, and an interesting new technology.
  2. A coding assessment came next; no tasks were shared.

H14: Three software engineering intern tasks

Report date: Sep 7, 2022 · Role: Software Engineer Summer Internship

Three tasks, in Python or C++.

  1. Initial bank balances: banks A and B run transfers in order (R[K] receives V[K] from the other); return the smallest starting [A, B] that never goes negative. R = BAABA, V = [2,4,1,1,2] gives [2,4]. Up to 100,000 transfers; they suggested a linear scan.
  2. Graph pruning: each second, remove every vertex of degree at most one; count seconds until nothing changes. With edges (0,1),(1,2),(2,0),(1,4),(4,5),(4,6) and N = 7, the answer is 2. They used an adjacency list and a removed set.
  3. Cranes: crane K at P[K] moves a package anywhere in [P[K]-A[K], P[K]+A[K]], reusable; can it get from B to E? A = [2,1], P = [5,1], B = 3, E = 6 is true. They suggested merging overlapping intervals.

Patterns across the reports

  1. Three tasks per sitting. 04, 05, 08 (three visible task slots), 09, 10, H12 and H14 all had three coding tasks.
  2. Strict output rules with worked examples. Edge outputs mattered: no trailing space (10), an empty-string answer (08), IMPOSSIBLE (09) or -1 (04, 05).
  3. The same letter-ordering task, 21 months apart. Ordered letter cases came up in January 2024 (10) and October 2025 (04).
  4. Early screens ask why the company and about projects. Both screens with questions shared (07, 09) asked what the firm does and about past projects, as did H13.

Common questions

How long is the Marshall Wace coding assessment?

80 minutes for three tasks for a quant summer candidate (04); 70 minutes for a mixed tech-intern test with SQL (06).

What coding questions does Marshall Wace ask?

Short array and string tasks with strict outputs: ordered letter cases (04, 10), shelf removal and pair erasure (08), email generation (09) and a notification cropper (10).

Does Marshall Wace ask SQL?

One tech intern got a SQL task on logins from multiple countries (06).

What does the Marshall Wace early screen ask?

Why the firm and why technology, what the company does, past projects, conflicts and challenges (07), and for an experienced hire, why they were changing jobs (09).

Keep practicing

In this series

Sources: Anywhere useful interview info can be found.

0 total reactions. Your reactions: none.
0 comments

Comments

0

No comments yet — be the first to share what you know.