Tower Research Capital Interview Questions and Answers
Last updated 2026-11-19
Tower Research Capital is a high-frequency trading firm with a large engineering team in India, so interviews are commonly described as a blend of quantitative reasoning and low-level systems knowledge: probability, puzzles, algorithms, C++ behaviour, operating systems and networks.
The questions on this page are practice problems in that style with worked answers, not real papers. For heavier algorithm practice go to Tower Research coding round questions, and for the maths side see probability and aptitude questions.
Rounds as commonly reported
Candidate reports describe an online round with aptitude or probability questions and coding, then several interviews. Interviews cover data structures and algorithms, probability and brain teasers, and fundamentals such as C++, operating systems, networking and computer architecture, followed by a discussion with a senior engineer or researcher. The firm has not published this process, so check your recruiter's instructions.
Why systems questions appear
A trading system lives and dies by latency. Interviewers therefore ask what happens in memory and on the network: cache lines, virtual dispatch, context switches, UDP multicast. Prepare to explain these from first principles.
Hiring status
We hold no sourced hiring dates, numbers or process facts for Tower Research, and this site has no /hiring page for it, so we state none. For current roles and the application route, use the Tower Research Capital careers site.
Tower Research Capital Interview Questions and Answers: questions with worked answers
1 Expected number of coin tosses until the pattern HT first appears?
mediumLet E be the expectation from scratch. Once a head appears, you wait for a tail, a geometric wait of mean 2. The wait for the first head is also mean 2, so the answer is 2 + 2 = 4. Compare with HH, which needs 6: after H, a failure resets you fully, but for HT a second head keeps you in the favourable state.
2 Break a stick at two random points. What is the probability the three pieces form a triangle?
hard1/4. Pieces form a triangle exactly when each is shorter than half the stick. Model the two cut points as (x, y) uniform in the unit square. The valid region, where no piece exceeds 1/2, is the union of two triangles with total area 1/4.
3 Explain how virtual functions work in C++ and their cost.
mediumEach class with virtual functions has a vtable, an array of function pointers, and each object holds a hidden pointer to it. A virtual call loads the vptr, loads the function address from the table, and calls indirectly. The cost is an extra memory access and a harder-to-predict branch that blocks inlining. In latency-critical paths, engineers use templates (static polymorphism) or the CRTP pattern to resolve calls at compile time.
4 What is false sharing and how do you avoid it?
hardCores cache memory in lines, commonly 64 bytes. If two threads write different variables that sit on the same line, the line bounces between cores as ownership changes, slowing both even though no data is truly shared. Avoid it by padding or aligning hot per-thread data to its own cache line, for example with alignas(64) in C++.
5 Why do market data feeds commonly use UDP multicast instead of TCP?
mediumUDP multicast sends one packet to many subscribers with no per-connection handshake or retransmission delay. TCP guarantees order and delivery but stalls later data while retransmitting a lost packet (head-of-line blocking), which is bad for fresh prices. Feeds add sequence numbers so receivers detect gaps and recover through a separate retransmission channel.
6 How do you check whether a number is a power of two, and count set bits?
easyA positive n is a power of two exactly when n & (n - 1) equals zero, since subtracting one flips the lowest set bit and everything below it. To count set bits, Kernighan's loop repeatedly clears the lowest set bit with n & (n - 1) and counts the iterations, so it costs O(number of set bits).
pythondef is_pow2(n): return n > 0 and (n & (n - 1)) == 0 def popcount(n): c = 0 while n: n &= n - 1 c += 1 return c7 What is the cost of a context switch and how do you reduce it?
mediumA switch saves and restores registers and the stack pointer, enters the kernel, and usually pollutes the CPU cache and TLB, so the hidden cost after the switch is often larger than the switch itself. Reduce it by using fewer threads than cores, pinning latency-critical threads to cores, busy-polling instead of blocking, and avoiding locks on the hot path.
8 Three switches outside a room control three bulbs inside. You may enter once. How do you map them?
easyTurn switch 1 on for several minutes, turn it off, turn switch 2 on, then enter. The lit bulb is switch 2; the warm but dark bulb is switch 1; the cold dark bulb is switch 3. This works by using heat as a second bit of information.
9 Why is quicksort often faster than merge sort in practice despite the worse worst case?
mediumQuicksort partitions in place with sequential access, so it uses cache well and needs no auxiliary array, while merge sort copies data. With a random or median-of-three pivot, the worst case O(n squared) is very unlikely, and introsort falls back to heapsort at a depth limit to guarantee O(n log n). Merge sort wins when stability or external sorting is needed.
10 Design a hash table suited to low-latency lookups.
hardUse open addressing with linear probing in one contiguous array, so a lookup touches few cache lines and avoids pointer chasing. Keep the load factor under about 0.5, use a power-of-two size so the index is a bit mask, preallocate to avoid rehashing on the hot path, and use a cheap, well-mixed hash. Deletion needs tombstones or backward-shift deletion.
11 You have two ropes that each burn in 60 minutes at uneven speeds. Measure 45 minutes.
easyLight rope A at both ends and rope B at one end at the same moment. Rope A burns out after 30 minutes. At that moment light the other end of rope B; its remaining 30 minutes of burning now takes 15. Total 45 minutes.
12 Why do you want to work at a trading firm?
easyBe concrete: you like problems where engineering decisions show up as measurable latency or profit, you enjoy probability and systems, and you want fast feedback. Mention a project, such as a custom allocator or a matching-engine toy, where you measured performance. Avoid saying it is mainly about money.
Frequently asked questions
Does Tower Research ask C++ questions?
Candidate reports commonly mention C++ and systems fundamentals for engineering roles. Check your role description to see which language matters.
How much probability should I know?
Expected value, conditional probability, linearity of expectation and basic combinatorics cover most reported questions.
Are puzzles still asked?
They are commonly reported, but interviewers vary. Practise the reasoning, not specific puzzles.
Where do I find openings?
On the Tower Research Capital careers site. This site has no sourced hiring data for the firm.
Related guides
More in Company Interview Questions
- Tower Research Coding Round Questions With Solutions
- Uber Coding Round Questions with Solutions in Python and Java
- Uber Interview Questions and Answers for SDE Roles
- UBS coding round questions with solutions
- UBS interview questions with answers (technology graduates)
- UST coding round questions
- UST interview questions and answers
- Virtusa coding round questions
- Virtusa interview questions and answers
- Visa coding round questions with solutions
- Visa interview questions with answers (software engineer, India)
- VMware Coding Round Questions with Solutions in Python and Java