Marshallwace UK 2026 Summer Quant Internship Online Test
Question Details
This post was last edited by Eric4 on 2025-10-01 23:35. There were three questions in total, mainly dynamic programming related, with a time limit of 80 minutes. Task 1: You are given a string letters
Full Details
This post was last edited by Eric4 on 2025-10-01 23:35. There were three questions in total, mainly dynamic programming related, with a time limit of 80 minutes. Task 1: You are given a string letters made of N English letters. Count the number of different letters that appear in both uppercase and lowercase where all lowercase occurrences of the given letter appear before any uppercase occurrence. For example, for letters = "aaAbcCABBc" the answer is 2. The condition is met for letters ‘a’ and ‘b’, but not for ‘c’. Write a function that, given a string letters,
returns the number of different letters fulfilling the conditions above. The following content requires points higher than 188. You can already browse Task 2: There is an array A, consisting of N integers, and two integers, L and R. Your task is to find the shortest fragment of consecutive elements of A that contains every integer from L to R inclusive. Write a function: that, given A, L and R,
returns the length of the shortest fragment of A that contains all numbers from L to R. If no such fragment exists, the function should return −1. Task 3: You are given a matrix A consisting of N rows and M columns. Each field of the matrix contains a positive integer. You want to find a path consisting of neighboring fields. Two fields are neighboring if they share a common side. The path can start and end on any field and can turn left or right at most once. The product of a path is an integer obtained by multiplying all the integers on the path. Find such a path whose product contains the maximum possible number of trailing zeros. Write a function that, given a matrix of integers, consisting of N rows and M columns,
returns the maximum number of trailing zeros that some path with at most one turn contains. Ask for rice plz plz
About This Question
This is a reported interview question from a marshallwace interview for a quant role (intern level) during the oa round reported in 2025.
It covers the following topics: Array, Strings, Dynamic Programming, Dynamic Programming, Arrays, Matrix .
About Marshallwace Interview Reports
This question was reported by a candidate who interviewed at Marshallwace. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Marshallwace are the higher-signal extractions to take from this report.
For broader preparation context, the Marshallwace interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Marshallwace reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Marshallwace Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Marshallwace reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.