Tower Research Capital coding interview questions
Ranked by how often candidates report them. Each opens in the editor with hidden tests, an animated walkthrough and solutions in four languages; a question you solve once counts for every company that asks it.
| Progress | Title | Difficulty | Next step |
|---|---|---|---|
| Shortest BridgeMulti source BFS | Medium | Solve | |
| Evaluate DivisionConnected Components | Medium | Solve | |
| Using a Robot to Print the Lexicographically Smallest StringMonotonic Stack | Medium | Solve | |
| Minimum Number of Taps to Open to Water a GardenGreedy | Hard | Solve | |
| Max Area of IslandMatrix Graphs | Medium | Solve | |
| Pow(x, n) (Binary Exponentiation)Search on Answer Range | Medium | Solve | |
| Largest NumberGreedy | Medium | Solve | |
| All Nodes Distance K in Binary TreeChild + Ancestor Handling | Medium | Solve | |
| Contiguous ArrayPrefix Sum Strategy | Medium | Solve |
No questions match these filters.
Also reported, being added to AlgoRung (4)
Cousins in Binary Tree · Count Complete Tree Nodes · Island Perimeter · Cut Off Trees for Golf Event
Questions people ask
What coding questions does Tower Research Capital ask most?
Shortest Bridge, Evaluate Division, Using a Robot to Print the Lexicographically Smallest String, Minimum Number of Taps to Open to Water a Garden, Max Area of Island, Pow(x, n) (Binary Exponentiation), Largest Number, All Nodes Distance K in Binary Tree.
Which topics come up in Tower Research Capital coding rounds?
graphs, grids, trees, greedy, dynamic programming, hash maps.
How hard are Tower Research Capital coding questions?
Of the reported questions, 0 are easy, 8 medium and 1 hard. A 45 to 60 minute live interview where you solve one or two data-structures-and-algorithms problems while explaining your thinking. Interviewers score problem solving, code quality, testing and communication.