Tower Research Capital LLC Interview Questions, Process, and Tips

Round duration - 90 minutes
Round difficulty - Easy

Consisted of 3 DSA questions and MCQ on python proficiency

Q1. 
Palindromic Substrings Problem Statement
Given a string S, your task is to return all distinct palindromic substrings of the given string in alphabetical order.
Explanation:
A string is considered a pal...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was a pure DSA round and interviewer was very helpful with providing significant hints to solve the given problems

Q1. 
Island Perimeter Calculation Problem
Given a binary grid representation of a map of an island, calculate the perimeter of the island. The grid uses '0' for water and '1' for land.
The grid has only one i...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

DSA+OS

Q1. 
Clearing the Forest Problem Statement
Ninja lives in a city called Byteland where a festive event is being organized. To make space for this event, Ninja is tasked with clearing a nearby forest. The fores...read more
Add your answer

Q1. Introductory questions
Add your answer
Q2. All security concepts
Add your answer
Q3. Practical scenarios and explanations
Add your answer

Q1. Details practical test
Add your answer
Q2. Explaining incidents faced
Ans. 
I have faced incidents related to system crashes, network failures, and security breaches.
• System crash due to hardware failure

• Network failure due to misconfiguration

• Security breach due to weak password policy

• DDoS attack causing website downtime
Answered by AI
Add your answer
Q3. Counter questions and reason for selecting the approach
Add your answer

Q1. Explaining the role suitability and reason for change
Add your answer

Q1. Why are you looking for a change?
Add your answer
Q2. What is your family background?
Add your answer
Q3. Share details of your previous job.
Add your answer
Q4. What are your salary expectations?
Add your answer
Q5. Why should we hire you?
Add your answer
Q6. What are your strengths and weaknesses?
Add your answer
Q7. Tell me about yourself.
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
Word Ladder Problem Statement
Given two strings, BEGIN and END, along with an array of strings DICT, determine the length of the shortest transformation sequence from BEGIN to END. Each transformation inv...read more
Ans. 
Start from the given start word.
Push the word in the queue
Run a loop until the queue is empty
Traverse all words that adjacent (differ by one character) to it and push the word in a queue (for BFS)
Keep doing so until we find the target word or we have traversed all words.
Answered Anonymously
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Q1. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
A graph where all vertices are connected with each other has exactly one connected component, consisting of the whole graph. Such a graph with only one connected component is called a Strongly Connected Graph.
The problem can be easily solved by applying DFS() on each component. In each DFS() call, a component or a sub-graph is visited. We will call DFS on the next un-visited component. The number of calls to DFS() give...read more
Answered Anonymously
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Q1. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Ans. 
Create a variable no = 2 and changed = false
Run a loop until there is no cell of the matrix which is changed in an iteration.
Run a nested loop and traverse the matrix. If the element of the matrix is equal to no then assign the adjacent elements to no + 1 if the adjacent element’s value is equal to 1, i.e. not rotten, and update changed to true.
Traverse the matrix and check if there is any cell which is 1. If 1 is pres
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Q1. How would you design a system like Splitwise?
Ans. 
Tip 1 : Make sure you ask relevant questions
Tip 2 : Focus on design principles
Answered Anonymously
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?
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. Recursion with memoisation.
• It can be proved that the greedy solution will not be optimum, so we need to solve this by dp or recursion. E.g., if ‘ARR’ = {6,4,4,6} and we try to merge the elements with minimum sum first, i.e. merge 4 and 4 first and so on, we will get the answer as 42, but the optimal merging gives 40.
• The main idea is to merge two consecutive numbers at every possible index ‘i’ and then recursively call ...read more
Answered Anonymously
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?
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. DFS
• Create a map to store the parent of each node in the tree, Traverse the tree recursively (via depth-first search), at each step if the current node is not NULL. Store its parent in the map, then traverse the left and right subtree.
• Now assume that the given node is the root of the tree. In such a case, we can simply run a breadth-first search from the root, and track the current level of the tree. When the level = ‘K...read more
Answered Anonymously
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. Brute Force
• We generate all the possible subarrays by using two nested loops.
• We can run two nested loops, the outer loop picks the starting element and the inner loop picks the ending element.
• The third loop considers all elements in between the starting and ending elements.
• Check if each subarray has equal number of 0s and 1s
• This can be easily done by considering 0 as -1 and 1 as 1 since the sum for equal numbers of 0s a...read more
Answered Anonymously
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.