HRT New Grad Python Track Interviews: 9 Experiences
- Company
- Hudson River Trading
- Reports
- 9 interview reports
- Level
- New Grad
- Stages
- OA → Phone screen
HRT new grad Python-track interviews: 2026 phone screens were one timed coding task, while 2022–2023 first rounds were reading and fixing Python.
At a glance
- Process: an OA (120 minutes in 2021), then a phone screen and a round 2 the recruiter outlined in advance. No report reached the onsite.
- Asked recently: in 2026 the phone screen was the Tilting Maze Ball task (02), and a recruiter said round 2 would ask Python candidates questions in C (01). In 2023, round 1 was reading snippets and debugging over SSH (03, 04).
- Difficulty: candidate 07 called the 2021 OA hard; 04 expected a rejection after the SSH debugging.
- Practise first: Tilting Maze Ball, Remove AB and CD Pairs and Longest Alternating a/b Path in a Tree.
Coverage: Hudson River Trading, new grad only (entries 05–09, from 2021–2022, are more than three years old) · Software Engineer / Python Developer on the Python track (7 reports), plus two new grad listings whose rounds tested Python: a Core Developer listing that names no language, and a Market Structure Optimization Engineer role (1 report each) · OA, phone screens and the recruiter's outline of round 2; no report reached the onsite · Singapore, other locations not stated · October 2021 to October 2026
Want every level, the intern reports, or what the onsite looks like? See the full HRT roundup: Part 1 (Python-track reports at every level) and Part 2 (interns, onsite and final rounds). For answers to the Python questions that keep coming up, see HRT Python-Track Interview Questions, Answered.
Roles in this article
- Python track (entries 01–07): Software Engineer, New Grad (Python track) and Python Developer, New Grad.
- Core Developer, New Grad (entry 08): the listing's title doesn't name a language, but its first round was almost all Python.
- Market Structure Optimization Engineer (entry 09).
Python track: Software Engineer / Python Developer, New Grad
What came up
Coding showed up in three of the seven Python-track reports: the 2026 phone screen and both 2021 OAs. Two reports from 2022 and 2023 describe a first round built around reading, explaining and fixing short pieces of Python instead.
| Topic (7 Python-track reports) | Reports | Last seen |
|---|---|---|
| Algorithm coding | 3 of 7 | Oct 2026 |
| Round 2 topics named by the recruiter in advance | 2 of 7 | Oct 2026 |
| Reading, explaining and improving existing Python code | 2 of 7 | Oct 2023 |
| Debugging on a remote machine over SSH | 1 of 7 | Oct 2023 |
The recruiter row is what candidates were told to expect, not questions they reported being asked. A candidate can appear in more than one row.
Questions we found
Each date is the post date of the report.
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Remove AB and CD Pairs: delete adjacent "AB" or "CD" until none are left | 2: 06, 07 | Nov 2021 |
| Longest Alternating a/b Path in a Tree: longest path where no two neighbours share a letter | 2: 06, 07 | Nov 2021 |
| Tilting Maze Ball: move a ball through a grid maze with timed tilt events | 1: 02 | Oct 2026 |
Code reading and debugging
| Question | Reports | Last seen |
|---|---|---|
| Read code snippets: say what each does, what's wrong with it, and how to make it faster | 1: 04 | Oct 2023 |
| SSH into a machine, find the error in a log file, fix the code or the data, then check the fix | 1: 04 | Oct 2023 |
Read a short function that uses yield, explain it, then improve it |
1: 05 | Oct 2022 |
Read a short function that opens a file with with, explain it, then improve it |
1: 05 | Oct 2022 |
| Check a function that computes stock prices: time complexity, correctness, improvements | 1: 05 | Oct 2022 |
Find the bug in a class that inherits from dict (how __setitem__ behaves) |
1: 05 | Oct 2022 |
7 detailed candidate timelines and screens
01: the recruiter said round 2 would be in C
Report date: 2026-10-07 and 2026-10-13 (post dates) · Role: Software Engineer, New Grad (Python track) · Location: Singapore · Result: Round 2 scheduled; no later update
Online assessment
- Passed. The candidate didn't describe the problems.
Round 1: technical phone screen (30 minutes)
- A short technical screen. The candidate passed it a few days after first posting, but didn't say what was asked.
Round 2: technical interview (1 hour)
- The recruiter said it covers data structures and algorithms, programming languages, operating systems, and how computers work underneath.
- The recruiter also said Python candidates get questions in C, to test low-level reasoning rather than knowledge of one language. In a reply, the candidate added that the recruiter's email mentioned "some C questions".
The candidate had been through HRT's discovery program the year before. As of early November 2026 they hadn't posted how round 2 went. Entry 02 was posted the same day at the same stage and may be the same person.
02: the phone screen was the maze task from the C++ track
Report date: 2026-10-13 (post date) · Role: Software Engineer, New Grad (Python track) · Result: Passed the phone screen
Phone screen
- The candidate passed and was getting ready for round 2.
- Moderation removed the details from the first post. In a reply, the candidate said their task was the same one a C++-track new grad (2027 graduating class) had posted ten days earlier: a ball in a grid maze, moved by timed tilt events.
Entry 01's second post went up the same day at the same stage, so the two may be one candidate. They're kept apart because nothing links them.
03: what round 2 covers, according to the recruiter
Report date: 2023-10-15 (post date) · Role: Python Developer, New Grad · Result: Passed round 1; round 2 not reported
OA and round 1
- The OA came first, then the phone rounds. The candidate had applied directly, and had interviewed with HRT for an internship before.
- Round 1 matched another report from that season (most likely entry 04). The candidate heard back 2–3 business days later.
- The recruiter's email said round 2 covers operating systems, algorithms, data structures and Python internals.
04: code reading, then debugging over SSH
Report date: 2023-10-11 (post date) · Role: Python Developer, New Grad · Result: The candidate expected a rejection
Phone screen (1 hour, after passing the OA)
- Quick code reading. The interviewer shows a snippet; you say what it does, what's wrong with it and how to make it faster. The candidate named generators, context managers and
__setitem__as things worth reviewing. - SSH into one of HRT's machines, find the error in a log file, change the code, then check the fix. If the data is wrong, fix the data; if the code is wrong, fix the code. The candidate compared it to an SRE support rotation.
- Medium difficulty overall. The candidate missed a few basic questions and spent too long on the debugging part, with many hints from the interviewer.
05: read, fix and improve four small pieces of code
Report date: 2022-10-18 (post date) · Role: Software Engineer, New Grad (Python) · Result: Not stated; the candidate felt they answered poorly
First round after the OA (video)
- A short function using
yield: read it, explain it, then improve it. - A short function that reads a file with
with: the same, with basic knowledge questions along the way. - A function that computes stock prices: analyze its time complexity and correctness, point out problems, and say how to improve it.
- A class that inherits from
dict: find what's wrong. You need to know how__setitem__behaves.
The candidate said it wasn't hard, but they didn't know many Python details well. In a reply, the candidate said "improve" meant two things: correctness (corner cases) and speed.
06: OA with a string problem and a tree problem
Report date: 2021-11-16 (post date) · Role: Python Developer, New Grad · Result: Not stated
OA (120 minutes, 2 problems)
- Remove adjacent "AB" or "CD" pairs until none are left. A stack works.
- In a tree whose nodes are each labelled "a" or "b", find the longest path where no two neighbouring nodes have the same letter.
07: the same two OA problems, three weeks earlier
Report date: 2021-10-28 (post date) · Role: Python Software Engineer, New Grad · Result: Not stated
OA (120 minutes, 2 problems)
- Remove adjacent "AB" or "CD" pairs.
- The longest path in an a/b-labelled tree with no two equal letters in a row.
The candidate rated it hard.
Core Developer, New Grad (Python-focused first round)
What came up
One report. The 45-minute round was almost all Python internals (generators, with, how a dict is built) plus threads, with a project question at the start.
Questions we found
Python knowledge
| Question | Reports | Last seen |
|---|---|---|
What yield is; iterators vs generators |
1: 08 | Jun 2022 |
What with does |
1: 08 | Jun 2022 |
| How a Python dictionary is implemented | 1: 08 | Jun 2022 |
| How a Python thread differs from an operating-system thread | 1: 08 | Jun 2022 |
CS fundamentals
| Question | Reports | Last seen |
|---|---|---|
| Threads vs processes, and what each is good for | 1: 08 | Jun 2022 |
Behavioral (BQ)
| Question | Reports | Last seen |
|---|---|---|
| Your most interesting project and the hardest bug in it | 1: 08 | Jun 2022 |
08: 45 minutes on how Python works
Report date: 2022-06-21 (post date) · Role: Core Developer, New Grad · Result: Not stated
The recruiter said the round would cover the candidate's background, data structures, networking and how Python works underneath.
First phone round (45 minutes)
- Your most interesting project and the hardest bug in it.
- What
yieldis, and iterators vs generators. - What
withdoes. - How a Python dictionary is implemented.
- Threads vs processes, and what each is good for.
- How a Python thread differs from an operating-system thread.
The questions took about 20 minutes. The candidate felt they got about 60% right, and the interviewer's only comment was that they answered quickly.
Market Structure Optimization Engineer (New Grad)
What came up
The posting made this job sound like light Python work. The phone round went low-level instead: decorators, memory, exchange latency and hardware.
Questions we found
Python knowledge
| Question | Reports | Last seen |
|---|---|---|
| What decorators can do, and which ones can make code faster (for example, caching) | 1: 09 | May 2022 |
CS fundamentals and trading systems
| Question | Reports | Last seen |
|---|---|---|
| Heap vs stack | 1: 09 | May 2022 |
| Ways to cut latency when talking to an exchange | 1: 09 | May 2022 |
| From your ML project: GPU acceleration, and whether you'd design hardware to cut latency | 1: 09 | May 2022 |
Behavioral (BQ)
| Question | Reports | Last seen |
|---|---|---|
| Your biggest Python project, and how you know your code is correct | 1: 09 | May 2022 |
09: a light-sounding role with low-level questions
Report date: 2022-05-04 (post date) · Role: Market Structure Optimization Engineer (a software role), New Grad · Result: Not stated
Phone round
- What decorators can do, and which decorators can make code run faster (for example, caching).
- Heap vs stack.
- Ways to cut latency when talking to an exchange. The candidate suggested connecting directly instead of going through the exchange's gateway. Asked how, they couldn't say.
- From the candidate's ML project: GPU acceleration, and whether they'd design hardware to cut latency.
- Their biggest Python project, and how they know their code is correct.
The posting suggested a few Python packages would do, but the questions went low-level. The candidate came away thinking HRT wanted someone who understands hardware acceleration.
Patterns across the reports
These patterns come from the Python-track section (entries 01–07).
- The same two OA problems in fall 2021. Entries 06 and 07, posted about three weeks apart, both had a 120-minute OA with the same pair: remove adjacent "AB"/"CD" pairs, and the longest a/b-alternating path in a tree. Entry 07 called it hard.
- Round 1 was code reading in 2022 and 2023, then a coding task in 2026. Entry 05 (2022) read, explained and improved four short pieces of code. Entry 04 (2023) read snippets and then debugged over SSH, and entry 03 said its own round 1 matched another report from that season. Entry 02 (2026) instead got one coding task, the same one a C++ new grad had posted ten days earlier. Entry 01's 2026 phone screen isn't described.
- In both 2023 and 2026, the recruiter laid out round 2 ahead of time. Entry 03 (2023) was told operating systems, algorithms, data structures and Python internals. Entry 01 (2026) was told data structures, algorithms, programming languages, operating systems and how computers work, with questions in C for Python candidates. Neither candidate posted how round 2 actually went.
Common questions
What is the HRT new grad Python phone screen?
In 2026, one timed coding task: the tilting maze ball (02), the same one a C++ new grad had posted ten days earlier. In 2022–2023 it was reading, explaining and fixing short Python snippets (04, 05).
What does HRT round 2 cover for Python new grads?
Recruiters laid it out ahead of time: operating systems, algorithms, data structures and Python internals (03, 2023), or the same plus how computers work, with questions in C (01, 2026).
Keep practicing
- Tilting Maze Ball: the 2026 phone-screen task from entry 02.
- Remove AB and CD Pairs: the first 2021 OA problem from entries 06 and 07.
- Longest Alternating a/b Path in a Tree: the second 2021 OA problem from entries 06 and 07.
- HRT behavioral questions: the behavioral questions on FastPrep for Hudson River Trading (sign-in needed).
- Hudson River Trading interview page: every HRT practice question on FastPrep.
- Interview experiences: the full Experience feed.
More HRT reports: Python track and onsite roundup, Part 1 · Part 2 · HRT Python-Track Interview Questions, Answered
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.