Tower Research Capital LLC Interview Questions, Process, and Tips for Experienced

C++ test related to trading

Q1. OS and CPU internals
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

There were
1. 25 C++/Java/Shell based MCQs
2. 2 SQL based questions - you are expected to write sql query based on the problem statement
3. Create React App - Todo App

Deadline was 7 days

Q1. Given an employee table and a department table, how would you output the person with the maximum earnings from each department?
Ans. 
Output the person with the maximum earnings from each department
• Join the employee and department tables on department ID

• Group by department ID and find the max earnings for each department

• Join the result with the employee table to get the person with max earnings
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

It was in afternoon 2PM. Interviewer was polite and helpful. He was trying me to push me more. At the end of the interview, he even gave me the good feedback

Q1. 
Minimum Cost to Reduce Array
Given an array ARR of size N containing positive integers, the task is to reduce the size of the array to 1 by performing a specific operation multiple times. In one operation...read more
Ans. 
Find the minimum cost to reduce an array to one element by merging adjacent elements.
• Iterate through the array and merge adjacent elements with the smallest sum each time.

• Keep track of the total cost as you merge elements.

• Repeat the merging process until only one element remains in the array.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was in the noon 2.30PM. Interviewer was the team lead. Interviewer was polite and helpful

Round duration - 30 Minutes
Round difficulty - Medium

Interviewer was the Division Manager. Was just scratching the surface in all domain like behavioural, tech questions, situational questions

Round duration - 60 minutes
Round difficulty - Easy

This was the qualification round which comprised of several MCQs and 3 coding questions.
It was held on Hackerearth from 3:00 PM to 4:00 PM.
Use of any other IDE was prohibited.

Q1. Given a problem statement and a piece of code, how would you find and correct the bug in the code?
Ans. 
To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.
• Understand the problem statement and expected output.

• Review the code for syntax errors, logical errors, and potential bugs.

• Use debugging tools like breakpoints, print statements, and IDE debuggers.

• Test the code with different inputs to identify the bug.

• Make necessary corrections based on the iden...read more
Answered by AI
Add your answer
Q2. 
Print Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...read more
Ans. 
Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.
• Traverse the binary tree to find the target node.

• Use BFS to traverse the tree from the target node to nodes at distance K.

• Keep track of the distance while traversing the tree.

• Return the values of nodes at distance K in any order.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM

Q1. 
Subarray Challenge: Largest Equal 0s and 1s
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input:
Input beg...read more
Ans. 
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
• Iterate through the array and maintain a count of 0s and 1s encountered so far.

• Store the count difference in a hashmap with the index as the key.

• If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.

• Return the length of the longest subarray found.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.