Tower Research Capital coding interview
questions, leaked.
2 problems reported across recent Tower Research Capital interviews. Top patterns: math, dynamic programming, tree. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Tower Research Capital's assessment hits you with exactly two problems: one medium DP problem on binary search trees, one hard matrix problem requiring union-find. You don't have time to waste on low-value drills. The medium is "Unique Binary Search Trees," which demands you understand Catalan numbers and tree counting. The hard is "Bricks Falling When Hit," a reverse-engineering matrix problem that uses union-find to track connected components. This is a condensed, high-leverage test. If you blank on either pattern during the live assessment, StealthCoder solves it invisibly in seconds, giving you the working code while the proctor sees nothing.
Top problems at Tower Research Capital
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Unique Binary Search Trees | MEDIUM | 100.0 | 62% | Math · Dynamic Programming · Tree |
| 02 | Bricks Falling When Hit | HARD | 73.5 | 36% | Array · Union Find · Matrix |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Tower Research Capital OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- math1 · 50%
- dynamic programming1 · 50%
- tree1 · 50%
- binary search tree1 · 50%
- binary tree1 · 50%
- array1 · 50%
- union find1 · 50%
- matrix1 · 50%
With only two problems reported, both are likely anchors of Tower's screening process. The medium spans math, dynamic programming, and tree concepts, so your first move is nailing Catalan number logic and DP on trees. The hard problem mixes matrix reasoning with union-find, a combo that requires you to think backwards through the problem space. Most candidates studying Tower will drill standard tree DP and basic union-find separately. What they miss is that these problems test your ability to combine structures under pressure. Study "Unique Binary Search Trees" first for pattern confidence, then reverse-engineer "Bricks Falling When Hit" to understand how to apply union-find in non-obvious ways. If you hit a wall on the hard problem during the actual OA, StealthCoder is your hedge, surfacing a working solution while you stay invisible to the proctor.
Companies with similar patterns
If you prepped for Tower Research Capital, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Tower Research Capital.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Tower Research Capital interview FAQ
Should I focus on tree DP before union-find for Tower Research?+
Yes. Tower's medium problem is "Unique Binary Search Trees," a pure DP-on-trees problem. Master Catalan numbers and the DP transition first. Union-find matters for the hard problem, but tree DP is the foundation you'll use under time pressure.
Is Catalan numbers something I need to memorize?+
Not memorize, but understand the formula and why it applies to BSTs. The medium problem tests whether you can derive the recurrence: C(n) = sum of C(i) * C(n-1-i). If you can't derive it under pressure, you lose time.
How do I approach 'Bricks Falling When Hit' if I've never seen it?+
The hard problem requires reverse thinking. Build the final state first, then reverse the hits. Use union-find to track which bricks are connected to the ceiling. This backwards approach is non-standard, so practice it explicitly before your OA.
What's the hardest part of Tower's assessment?+
The hard problem combines matrix iteration with union-find, and you must think backwards. Most candidates see union-find and default to forward-building. Tower is testing whether you can reverse-engineer the problem state under time pressure.
How many hours should I spend on each problem?+
Spend 2 to 3 hours on "Unique Binary Search Trees" (medium, higher confidence payoff). Spend 3 to 4 hours on "Bricks Falling When Hit" because it's the hard problem and requires reverse-thinking practice. Tower's small problem set means every hour counts.