HRT SWE Intern and Onsites: 34 Experiences (Part 2 of 2)
- Company
- Hudson River Trading
- Reports
- 34 interview reports
- Level
- Unknown
- Stages
- OA → Phone screen → Onsite
HRT intern, onsite and phone-screen reports from C++ or unstated-language candidates (2021–2026): scheduler screens and long onsite class problems.
At a glance
- Process: interns took an OA and one or two phone screens before a final round. New grad onsites centered on one long class-implementation problem (56 in 2026, 59 in 2021).
- Asked recently: intern phone screens from 2023 to 2025 reused three themes: a scheduler or coroutine (32, 37, 38, 39), the contact-tracing problem (32, 38, 39) and latency spikes in a trading system (37, 38, 39). The 2022 intern rounds were fundamentals: ordered vs unordered maps, union-find, IPC and ray tracing.
- Difficulty: candidate 34 applied for Python and had to interview in C++, and 31 the other way round. Memory, OS and networking questions came up for C++ candidates too (Patterns, point 7).
- Practise first: Contact tracing, Design a concurrent framework like Python's asyncio, Write itoa and Fancy numbers.
Coverage: Hudson River Trading · 15 intern reports (2022–2026) · 14 onsite or final-round reports from software engineer candidates whose language was C++ or not stated, including five new grads (2021–2026) · 5 C++ or unstated-language phone screens (2022–2026) · US, UK and Singapore
The topic and question tables for all 64 reports are in Part 1. The new grad reports that tested Python are collected in one new grad article.
In this series
- Part 1: the 30 Python-track reports (Python-knowledge rounds, debugging over SSH, the full London Python loop, new grad Python rounds from 2021 to 2026, and two new grad Python OAs) plus the question tables for the whole series.
- Part 2 (current): 15 intern reports, 14 onsite or final-round reports and 5 phone screens from C++ or unstated-language candidates, plus patterns across all 64.
Detailed candidate timelines, continued (31–64)
Intern reports
31: C++ title, Python interview
Report date: 2026-08-06 · Role: C++ Software Engineer Intern (Early Access program) · Result: No offer
Technical round
- The process was described as a 30-minute virtual technical round, a 60-minute technical round and then an onsite.
- Both the job title and the recruiter's email said C++, but the interview was in Python.
- The task: given a small existing codebase, extend one of its APIs. The candidate found it easy but said the interviewer barely engaged.
32: asyncio-style framework and contact tracing on the phone
Report date: 2024-11-29 · Role: Software Engineer (Internship) · Location: Singapore · Result: No offer
OA
- A 3-hour CodeSignal test.
Phone screen (1 hour)
- Long problem statements, less LeetCode and more talking through the design and algorithm.
- Design a concurrent framework, along the lines of Python's
asyncio. - A contact-tracing graph problem.
33: a final round that went well, then a rejection
Report date: January 2023 (post date) · Role: Software Engineering Intern (Python postings) · Location: Singapore · Result: Rejected
- OA, then a phone screen on data structures and operating systems.
- A final-round CoderPad interview with a senior developer, which the candidate felt went well.
- HR then cancelled the follow-up chat with the team lead and rejected them. The candidate thought it was because they had applied to other HRT openings at the same time.
34: applied for Python, interviewed in C++
Report date: 2022-04-12 (post date) · Role: Core Developer Intern (applied for the Python track) · Result: Did not pass
Round 1 (fundamentals)
- Vector vs linked list; how a vector is built; why a growth factor of 1.5 is used.
- How to build a deque and what each operation costs; then how to make it circular.
- Threads vs processes, why a thread context switch is cheaper, and how processes talk to each other.
- Find a peak element in an array, then a peak in a 2D grid.
Round 2 (had to use C++)
- Your favorite data structure, where you used it in a course or project, and how it helped.
- Read any number of characters through a fixed 4096-byte read call, called many times, using as little extra space as possible, with follow-ups.
- Build a rate limiter. The candidate built a single-threaded token bucket. Follow-ups: where a profiler would show most of the time, and how it scales.
35: C++ intern, a path-sum phone screen
Report date: 2026-07-07 (post date) · Role: C++ Software Engineer Intern · Result: Passed
First round (1 hour, Zoom)
- A few minutes on background.
- A binary tree of integers and a target: is there a root-to-leaf path whose values add up to the target? Values can be negative, an empty tree returns false, and the path must end at a leaf. No test cases were given.
- Follow-up: return every such path.
- The candidate found it easier than expected. The interviewer cared most about edge cases and explaining the approach, and asked no C++ knowledge questions.
36: intern OA: budget queries and a weighted tree
Report date: 2025-09-08 (post date) · Role: Developer Intern · Result: Not stated
OA
- An array of prices and a list of queries. Each query gives a starting index and a budget: how many items can you buy from that index on?
- A tree with a weight on each node: for each node, report its largest weight minus its smallest weight. The candidate said a BFS is enough; the exact range (most likely the node's subtree) wasn't confirmed.
37: Singapore intern, build a coroutine and explain latency spikes
Report date: 2025-03-26 (post date) · Role: Software Engineer Intern (Singapore) · Result: Waitlisted
First round
- A short intro, no resume questions.
- The interviewer guided the candidate step by step to implement a coroutine.
- A low-latency trading system sometimes shows latency spikes: what could cause them?
- The candidate rated it the hardest level, with a friendly, patient interviewer.
38: intern phone screen: a scheduler, contact tracing and memory latency
Report date: 2024-11-05 (post date) · Role: Software Engineer Intern (campus) · Result: Passed
Phone screen
- Design a task-scheduling system and discuss concurrency, networking and scheduling policy.
- Contact tracing: given the people infected on one day, find everyone who may be infected.
- Reading price data from a data structure: discuss latency in terms of the TLB, cache locality, page faults and virtual memory.
39: intern phone screen: three scenario questions, no coding
Report date: 2024-10-24 (post date) · Role: Software Engineer Intern (campus) · Result: Did not pass
First round
- Design threads that run in user space and can't be interrupted: how do you schedule them? Follow-ups: what if one runs too long, and the pros and cons of user-space threads vs a single thread.
- Contact tracing: the people infected at the start of a day and the pairs who met that day; who may be infected? Follow-up: over 10 days.
- A trading strategy's latency variance becomes very large: what could cause it?
A reply from another candidate said they got the same three questions a year earlier.
40: intern OA with full problem statements
Report date: 2024-09-20 (post date) · Role: Software Engineer Intern · Result: Not stated
OA (CodeSignal, 3 problems, fairly easy per the candidate)
- Fancy numbers.
- Simulate a board game on an n×n grid: each move places a black or white piece, which flips the opponent's pieces trapped between it and the player's own pieces. Moves don't have to alternate. Return the number of black and white pieces at the end.
- Build a tree from rows of [key, value, child row indices], then merge two such trees: if the roots' keys differ, the result is empty; nodes reached by the same key path merge, the right tree's value wins, and children keep the left tree's order with the right tree's new children after them. Print the merged tree in pre-order.
41: intern phone screen: fundamentals and ray tracing
Report date: 2022-11-03 (post date) · Role: Software Engineer Intern · Result: Passed
First round
- Vector vs list.
- Ordered map vs unordered map.
- How to build a hash map: handling collisions, and what to do when the table is full.
- How memory address translation works.
- How to speed up 3D ray tracing.
42: intern final round: hash maps, IPC, union-find and the 2048 game
Report date: 2022-10-13 (post date) · Role: Software Engineer Intern · Result: Rejected a week after round 2
Round 1
- What the operating system does when you run a program from the command line, asked in more and more detail.
- Build a hash map: chaining for collisions, then a balanced tree in each bucket, and expected vs guaranteed O(log n).
- Ways processes communicate and their tradeoffs; then exactly how to use shared memory.
- Union-find.
- A ray in 3D and many surfaces: find the intersections fast. The interviewer hinted at partitioning space.
Round 2
- Implement the 2048 game's move. Follow-up: use rotation so you handle one direction instead of four.
43: Core Dev intern phone screen: maps, union-find, pipes and sockets
Report date: 2022-10-03 (post date) · Role: Core Developer Intern · Result: Did not pass
Phone screen
- An intro to HRT and how core dev differs from algorithm dev.
- Tree map vs hash map: costs and how each is built.
- Design a disjoint set: complexity and optimizations.
- How a shell pipe works: the order the two programs run in, and how the kernel handles them running at once.
- Ways processes communicate, how sockets work, and how sockets differ from pipes.
44: intern video round: five discussion questions
Report date: 2022-09-22 (post date) · Role: Software Engineer Intern · Result: Did not pass
Video round (no coding)
- Ordered vs unordered maps and how each is built.
- Union-find with path compression.
- Python generators and how
yieldworks. - Unix commands, especially how the OS sets up a pipe between processes.
- Given a ray and many 3D triangles, which triangle does it hit? (k-d trees)
45: intern phone screen: vector growth, deques and local minimums
Report date: 2022-03-01 (post date) · Role: Software Engineer Intern · Result: Did not pass
First round after the OA
- How
push_backworks and what it costs. Is it still amortized O(1) if capacity grows by 1000 each time? By 1.5 times? - A container with amortized O(1) push and pop at both ends, then O(1) random access.
- Threads vs processes, and ways processes communicate.
- Find any local minimum in an array of distinct values, then one in an n×n grid.
Onsite and final-round reports from other SWE candidates (C++ or language not stated)
46: new grad, asked to know things "down to the memory level"
Report date: 2026-07-02 · Role: SWE New Grad · Result: No offer
- A Codility OA, then live interview rounds the candidate called pretty difficult.
- The candidate's takeaway: HRT wants people who understand things deeply and at a low level, down to memory and how kernels work. The language wasn't stated.
47: a full onsite day with a garbage-collector question
Report date: November 2025 (post date) · Role: Not stated · Experience: previously at a large hardware company · Result: The candidate believes they failed
Onsite (full day)
- One interviewer insisted
std::vector::push_backis O(1). The candidate argued that the occasional full reallocation is O(N) and matters for real-time code. - Two interviewers asked how to implement a garbage collector. They pushed back on the candidate's answer, which drew on a reference-counting collector they had worked on, and seemed to want a different design.
48: binary search medium and system design at the onsite
Report date: 2025-11-07 · Role: Software Engineer · Location: New York · Result: Offer, declined
- A phone screen, then a LeetCode-medium round.
- An onsite with another LeetCode medium (a binary-search problem) and some system design questions. The candidate called it not too hard if you'd practiced.
49: floating point, bits and Union-Find, offer accepted
Report date: 2025-07-01 · Role: Software Engineer · Location: New York · Result: Offer, accepted
- OA, a 1-hour technical phone screen, then an onsite.
- The problems weren't the hardest, but the range of topics was wide: floating point, bit manipulation, data structures and algorithms, and basic OS concepts. One question was a basic application of Union-Find.
50: final round with a packet-routing design
Report date: 2025-04-01 · Role: Software Engineer · Location: US · Level: Junior · Result: No offer
- Reached the final interview round, in C++.
- Design question: how would you design a system that routes network packets between one hub and several node servers?
- The candidate was unhappy with the rounds. Answers using C++20 features confused the interviewers, and they kept nudging until the candidate matched the answer they expected.
51: hard DP and an offer
Report date: 2024-07-19 · Role: Software Engineer · Location: US · Result: Offer, declined
- OA, phone screen, then interviews with engineers.
- The OA was the hardest part. The phone screen focused on thought process more than difficulty.
- Questions were LeetCode-hard dynamic programming.
52: a hit counter whose payloads don't fit in memory
Report date: 2023-07-03 (post date) · Role: Not stated · Result: The candidate felt the round went badly
Onsite round
- Start from the classic hit counter:
hit(timestamp)records a hit, andgetHits(timestamp)returns the hits in the last 5 minutes. - Add
get_messages(timestamp), which returns the payload messages for a timestamp. There can be several per timestamp. - The twist: each payload can be a couple of KB, too many to keep in memory, though the timestamps themselves fit.
- The candidate kept timestamps in memory and wrote messages to a single append-only file, in a simple SSTable style. They planned a background thread for disk writes and for dropping old messages.
- The interviewer hinted at two follow-ups the candidate didn't explore. First, when should a message go straight to disk, and when should it sit in an in-memory cache? How would you decide from the load, and estimate that load with rough numbers? Second, are there better options than an SSTable for the disk side?
- Looking back, the candidate felt they jumped into coding before asking enough questions.
53: topic list in advance, full-day onsite
Report date: 2023-05-14 · Role: Software Engineer · Location: London · Result: No offer
- Two phone interviews, then a full-day onsite.
- HRT sent a list of topics to prepare before the onsite. One question shared: why do you want to work here?
54: two 3-hour final days
Report date: 2022-10-01 · Role: Software Engineer · Location: US · Result: No offer
- OA, then a non-coding technical screen, then a technical interview.
- Two final interview days of 3 hours each.
- One question shared: how can you run multiple processes on one computer?
- More than three weeks passed between the OA and the first interview.
55: a 2-hour coding block, then talking it through
Report date: About 2022 (comment posted 2023-05-04) · Role: Not stated · Experience: Experienced · Result: Offer, declined
First onsite session (about 2 hours at a computer)
- Four questions: a parsing warm-up with edge cases; a data structure to implement, judged on how efficient it would be in practice; and two algorithm problems, the last framed as a bonus. The candidate finished in about an hour.
Other onsite interviews
- Less coding, more discussing approaches: optimizing a backtracking problem, a math question, and memory management.
- On one, the candidate took an unexpected route, got it wrong, took a hint and then solved it.
More onsite reports
56: new grad onsite: one long object-oriented coding problem, plus reaction games
Report date: 2026-09-13 (post date) · Role: Software Engineer, New Grad 2027 · Result: Passed the onsite
OA
- An array of prices and queries of (starting index, budget): the most items you can buy from that index on.
Onsite
- One problem in 75 minutes, object-oriented in style: write a class's constructor plus store and retrieve methods for a tiered item store.
- Many small rules: retrieve from the top level down, skip expired items, check whether a level still has at least half its capacity, and prefer heavier items. The candidate's advice: take time to understand the problem before coding.
- Zap-N: short games that test reaction speed and planning, such as picking the matching string from four look-alike options in about a second, and a puzzle like the Tower of Hanoi.
57: new grad onsite: a C++ reader for a file split into chunks
Report date: 2026-08-08 (post date) · Role: Software Engineer, New Grad (bachelor's) · Result: Not stated
- Implement a C++ file reader. One logical file is split into many chunks stored in different places.
- Starter code and a low-level API were provided. Read and process the file by the given rules, and handle errors.
58: new grad Core Developer onsite in Singapore: four rounds
Report date: 2021-11-04 (post date) · Role: Core Developer (C++), New Grad, Singapore · Result: Rejected three days after the onsite
OA (80 minutes): 2 problems the candidate called not hard.
Phone 1 (45 minutes)
- What
inlinedoes; what happens whenmallocfails; what happens on a segmentation fault. std::mapvsstd::unordered_map; how a virtual address maps to a physical one.
Phone 2 (45 minutes)
- A helper function that takes a
const char*and should point it at "hello". - Check whether the machine is little-endian.
- Write itoa, and compare two signatures: passing the buffer in vs returning it.
Onsite (four 60-minute rounds, about 4.5 hours with a break)
- A DevOps-style round: how you'd track down a bug, and a time your own change crashed production and how you fixed it.
- A hard algorithm problem: the candidate gave a slow solution first, then reached the best one with hints.
- A stream reader: given a function that reads 4096 bytes at a time, build something that can read any number of bytes per call.
- A team lead round: which system call to read a 100 GB file (
mmap), how it differs fromreadand whenreadis better; how to debug a bad network connection; what matters when choosing an offer; why HRT.
59: new grad Core Developer onsite: a 2-hour class problem, then system design
Report date: 2021-10-07 (post date) · Role: Core Developer, New Grad · Result: Rejected during the onsite
Phone 1 (45 minutes)
- How
inlineis used; stack vs heap; how to tell which way the stack grows. - Ways processes communicate.
- Build a deque that also supports access by index.
Phone 2 (45 minutes)
- How to change a string given as
const char*. - itoa and atoi, careful with 0 and the most negative int.
Onsite
- Two hours on one coding problem: not hard but fiddly, mainly filling in functions inside a class, with many optimizations asked for (lazy updates and similar). The basic version passed all tests; the optimized version wasn't finished.
- A traditional system design round. The candidate hadn't prepared and was let go right after it.
The candidate's takeaway: HRT values people who are very fluent and fast in C++.
Phone screens (C++ or language not stated)
60: experienced hire, the maze task in 30 minutes
Report date: 2026-10-08 (post date) · Role: Software Engineer · Experience: Experienced · Result: No offer
Video interview (about 30 minutes)
- The same maze task as entry 61.
- In about 30 minutes: understand the problem, explain it and the approach, write the code, explain it and run it.
- The candidate went straight to an efficient solution: precompute how far the ball can travel in each direction from every cell, then use the time between tilt events to work out how far it gets. It ran correctly on the first try.
- But they misread one rule: whether a certain kind of cell can be passed through. The interviewer pointed it out after the code was done, and there was no time left to change it.
- In replies, another candidate said they made the same mistake, and a third said about 10 minutes went to the explanation, leaving about 15 to code.
61: C++ new grad: four OA tasks, then the maze task
Report date: 2026-10-03 (post date) · Role: Software Engineer, New Grad 2027 (C++) · Result: Did not pass the phone screen
OA
- Two very easy tasks the candidate didn't describe.
- The largest sum over diamond-shaped regions of a grid.
- The street position lit by the most streetlights, smallest position on ties.
Phone screen (timed)
62: low-level C++ role: a phone screen of C++ knowledge
Report date: 2026-07-09 (post date) · Role: Low-level C++ software engineer (recruiter-sourced) · Experience: Experienced · Result: Not stated
First phone screen (10 minutes of chat, then about 30 minutes of questions)
- Memory: stack vs heap; how to find which way the stack grows on an unfamiliar machine, and why comparing two locals in one function isn't enough.
inline: what expanding a function at the call site buys you, and what overusing it costs.- What
newdoes, whatmallocdoes, and placementnew: why you'd use it and where it helps performance. - Pointers vs references, and what happens in a segmentation fault.
- Algorithms: two numbers in a vector that sum to a target; the K smallest elements of an unsorted vector, the ways to do it, how quickselect works, and why it's O(n) on average despite an O(n²) worst case.
63: second phone round: printing, vectors and itoa
Report date: 2023-11-28 (post date) · Role: Software Engineer · Experience: Experienced · Result: Waiting when posted
- Fill in code that prints a string. The candidate added a newline the print call already had.
- Some basic vector operations.
- itoa: turn an integer into a string. The candidate said it shows up often on the forum.
- No one in the replies had onsite details. One reply said HRT's onsite runs longer than two hours.
64: new grad Core Developer phone screen: one long chain of C++ and OS questions
Report date: 2022-11-01 (post date) · Role: Core Developer, New Grad · Result: Not stated
First phone round (cameras off)
- A short intro and resume chat.
std::vectorinsert and delete costs, what "amortized" means, how many copies 100 inserts cause with doubling and why the total is O(n), when to shrink after deletes, and why to leave a gap so growing and shrinking don't keep flipping.- What
newdoes vsmalloc, how you'd write your ownmalloc, and howfreeknows the block's size. - What a segmentation fault is, how dereferencing NULL triggers one, what a page table is, and why virtual memory helps.
- What
inlinedoes, why skipping a jump helps, why jumps are slow, and the downside of code growth.
Patterns across the reports
-
Python questions go under the hood. Nineteen of the 30 Python-track reports had questions about Python itself (02, 03, 04, 05, 06, 07, 08, 09, 11, 14, 18, 19, 21, 22, 24, 25, 26, 27 and 30). The dict was the repeat: 04, 09, 19, 21 and 26 were asked how a dict works, and 12 and 25 were shown a buggy
dictsubclass. Generators came up in 18, 21, 22, 24, 25, 26 and 30, and context managers in 06, 22, 24, 25, 26 and 30. Each of these questions is answered in the companion prep guide: HRT Python-Track Interview Questions, Answered. -
The new grad Python first round has kept the same shape since 2022. Entries 25 and 26 (2022) and 24 (2023) were knowledge and code-reading rounds: say what a snippet does, find what's wrong, improve it, sometimes followed by debugging over SSH (24). The 2026 Python-track new grad (20) instead got a timed coding task. The 2021 Python new grad OA (28 and 29) used the same two problems for two candidates.
-
Reading and debugging code in a real terminal. Entries 12, 16 and 24 describe SSHing into a prepared machine and working on Python there, and 22 had an SSH part too. Entries 05, 08, 22, 24 and 25 describe "what does this code do" questions.
-
The 2026 new grad phone screen is one timed coding task. The Python-track new grad (20) and the C++ new grad (61) got the same maze task, and an experienced candidate (60) got it as well. Reading every rule before coding mattered more than speed: 60 lost on one misread rule.
-
The new grad onsite centers on one long class-implementation problem. Entry 56 (2026) had one 75-minute problem with many small rules. Entry 59 (2021) had two hours of filling in a class's functions and then optimizing them. Entry 58 (2021) had four rounds, one of them a stream reader built on a 4096-byte read call. Entry 57 (2026) was a C++ reader for a file split into chunks.
-
Intern phone screens from 2023 to 2025 reuse three themes. A scheduler, user-space threads or a coroutine (32, 37, 38, 39); the contact-tracing problem (32, 38, 39); and diagnosing latency spikes in a trading system (37, 38, 39). In 2022 the intern first round leaned on fundamentals instead: ordered vs unordered maps (41, 43, 44), union-find (42, 43, 44), pipes and IPC (42, 43, 44, 45), 3D ray tracing (41, 42, 44) and vector growth or deques (34, 45).
-
Low-level systems questions show up for C++ and Python candidates alike. Memory, OS, networking or Linux questions appear in Python reports 04, 09, 18, 21, 22, 26, 27 and 30. They also appear in C++ or unstated-language reports 34, 46, 47, 49, 54, 55, 58, 59, 62 and 64.
-
The language on the title isn't always the language in the room. Entry 31 applied for a C++ internship and interviewed in Python. Entry 34 applied for Python and interviewed in C++. A 2026 Python-track new grad in the new grad Python article (entry 01 there) was told Python candidates get questions in C.
Common questions
What do HRT intern phone screens ask?
From 2023 to 2025: a scheduler, user-space threads or a coroutine (32, 37, 38, 39), contact tracing (32, 38, 39) and diagnosing latency spikes (37, 38, 39). In 2022 they were CS fundamentals instead (41–45).
What is the HRT new grad onsite like?
One long problem with many small rules, such as 56's 75-minute class problem in 2026, or 59's two hours of filling in a class and then optimizing it.
Keep practicing
- Practice from these reports: Design a concurrent framework (32); contact-tracing graph problem (32, 38, 39); Fancy numbers (40); how to implement a garbage collector (47); design a system that routes network packets between one hub and several node servers (50); Start from the classic hit counter (52); tiered item store (56); C++ file reader (57); Write itoa (58, 59); maze task (60, 61); The largest sum over diamond-shaped regions of a grid (61); The street position lit by the most streetlights, smallest position on ties (61).
- HRT banks: the coding bank and behavioral bank (sign-in needed), and every HRT question on the Hudson River Trading interview page.
- More reports: the Experience feed.
In this series: Part 1 · Part 2 (current)
Prep guide: 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.