Tower Research Capital LLC SDE-2 Interview Questions, Process, and Tips

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