Filter interviews by
I was interviewed before Mar 2024.
Leetcode simple problems. But with coding
C++ basics and operating systems basic
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 2 interview rounds.
DSA medium level questions were asked.
MakeMyTrip is a travel booking application that allows users to book flights, hotels, and holiday packages.
Include features like flight/hotel search, booking, payment gateway integration, and user profiles.
Implement filters for search results, reviews/ratings for hotels, and notifications for booking updates.
Integrate maps for location tracking, weather forecasts, and customer support chatbot.
Offer discounts, loyalty p...
I applied via Referral and was interviewed before Jul 2023. There were 2 interview rounds.
C++ test related to trading
I was interviewed in Jun 2022.
Round duration - 70 Minutes
Round difficulty - Hard
The test link was active for a week, and you can give anytime you like. The IDE was very good and self explanatory. There were 2 coding questions and 15 aptitude questions.
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N
houses numbered from 1 ...
Find the shortest path between two houses in a city represented as an unweighted graph.
Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.
Start BFS from the source house and keep track of the path taken to reach each house.
Once the destination house is reached, backtrack from destination to source to find the shortest path.
Consider using a queue data structure to implement BFS eff...
You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, and two node values, a
and b
. Your task is to determine if ...
Check if two nodes in a binary tree are cousins by comparing their levels and parents.
Traverse the tree to find the levels and parents of the given nodes.
Compare the levels and parents of the two nodes to determine if they are cousins.
If the levels are the same and the parents are different, the nodes are cousins.
Round duration - 60 Minutes
Round difficulty - Medium
It contained two programming questions.
Given the root of a complete binary tree, calculate the total number of nodes in this tree.
A complete binary tree is defined as a binary tree...
Count the total number of nodes in a complete binary tree given its root.
Traverse the tree in level order and count the nodes
Use a queue to keep track of nodes at each level
Check for null nodes represented by -1 in the input
The total number of nodes in the example tree is 7
Given an array ARR
consisting of non-negative integers, rearrange the numbers to form the largest possible numerical value. You are not permitted to alt...
Rearrange array numbers to form the largest possible numerical value by combining digits of each number in the array.
Convert integers in the array to strings for easier manipulation.
Sort the array of strings in non-increasing order based on custom comparison function.
Join the sorted strings to form the largest possible number.
Round duration - 60 Minutes
Round difficulty - Medium
This was more of a interaction round with some technical skills.
ACID properties ensure database transactions are processed reliably. Rollback mechanism undoes changes if transaction fails.
ACID properties: Atomicity, Consistency, Isolation, Durability
Atomicity ensures all operations in a transaction are completed successfully or none at all
Consistency ensures database remains in a valid state before and after transaction
Isolation ensures transactions are independent and do not inter...
Tip 1 : Focus on different varieties of problems, quality of problems matter greater than the quantity.
Tip 2 : Focus on design thinking, that will help in rounds other than problem solving.
Tip 1 : Focus on demonstrating your academic excellence and course projects
Tip 2 : Mention internship details with clarity
Tower Research Capital LLC interview questions for popular designations
I was interviewed in May 2022.
Round duration - 45 Minutes
Round difficulty - Easy
The interviewer was friendly. Explained the question well. Allowed to use any preferred platform to write code.
Given an array prices
representing the prices of a stock where each element indicates the price at a given minute, determine the maximum profit you can ac...
Find the maximum profit by buying and selling a stock once based on given prices.
Iterate through the prices array and keep track of the minimum price seen so far and the maximum profit achievable.
Calculate the profit by subtracting the current price from the minimum price and update the maximum profit if needed.
Return the maximum profit, ensuring it is not negative.
Example: prices = [2, 100, 150, 120], Buy at 2, sell a
Round duration - 60 Minutes
Round difficulty - Medium
Imagine you are helping Ninja, a dance coach, who needs to form dance pairs from the available boys and girls in a studio. Given the number of boys N
, the number of girls M
, a...
The challenge involves forming dance pairs from available boys and girls based on potential pairings to maximize the number of pairs.
Parse the input to get the number of test cases, boys, girls, and potential pairings.
Iterate through the potential pairings and form pairs based on the given indexes.
Output '1' if a set of maximum possible pairs is returned, else output '0'.
There can be multiple valid configurations of pa...
Multiprocessing involves multiple processes running concurrently, while multithreading involves multiple threads within a single process.
Multiprocessing utilizes multiple processes to execute tasks simultaneously.
Multithreading involves multiple threads within a single process sharing the same memory space.
Multiprocessing is typically used for CPU-bound tasks, while multithreading is more suitable for I/O-bound tasks.
E...
Round duration - 60 Minutes
Round difficulty - Hard
Splitwise is a system for managing shared expenses among groups of people.
Classes: User, Expense, Group
Functions: addExpense(), settleUp(), calculateBalance()
Round duration - 60 Minutes
Round difficulty - Hard
Tip 1 : Practice at least 5 questions of each topic of various difficulty levels
Tip 2 : Read out theory articles about your preferred language showing your proficiency in the same.
Tip 3 : Hard work is overrated, consistency is the key.
Tip 1 : Own everything you have there, do not add random skills that you are not proficient in.
Tip 2 : Keep it clean and try to give out minimal but most of the relevant information for the role.
Get interview-ready with Top Tower Research Capital LLC Interview Questions
I was interviewed in Feb 2022.
Round duration - 90 minutes
Round difficulty - Easy
Consisted of 3 DSA questions and MCQ on python proficiency
Given a string S
, your task is to return all distinct palindromic substrings of the given string in alphabetical order.
A string is considered a pal...
Return all distinct palindromic substrings of a given string in alphabetical order.
Iterate through all possible substrings of the given string.
Check if each substring is a palindrome by comparing it with its reverse.
Store all palindromic substrings in a set to ensure uniqueness.
Return the sorted list of palindromic substrings.
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
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...
Calculate the perimeter of an island represented by a binary grid.
Iterate through the grid and count the perimeter based on land cells and their adjacent cells.
Each land cell contributes 4 units to the perimeter, subtract 2 units for each adjacent land cell.
Handle edge cases where land cells are at the boundaries of the grid.
Return the total perimeter for each test case.
Round duration - 60 minutes
Round difficulty - Hard
DSA+OS
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...
Calculate the minimum number of steps Ninja needs to cut down all trees in a forest grid.
Iterate through the grid to find the shortest path to cut down all trees in order.
Use a priority queue to keep track of the shortest trees to cut next.
If it's impossible to cut all trees, return -1.
Consider all four cardinal directions for movement in the grid.
Tip 1 : Practice at least 250 questions
Tip 2 : Do at least two projects
Tip 1 : Should be covered in One page
Tip 2 : Project description should be professional
posted on 10 Mar 2022
I applied via Recruitment Consulltant and was interviewed in Feb 2022. There were 4 interview rounds.
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
I was interviewed in Dec 2021.
Round duration - 90 minutes
Round difficulty - Medium
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...
The Word Ladder problem involves finding the shortest transformation sequence from one word to another by changing one letter at a time.
Use breadth-first search to find the shortest transformation sequence.
Create a graph where each word is a node and edges connect words that differ by one letter.
Keep track of visited words to avoid revisiting them.
Return -1 if no transformation sequence is possible.
Round duration - 50 minutes
Round difficulty - Medium
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...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count whenever a new island is encountered.
Consider all eight possible directions for connectivity between cells.
Handle edge cases like out of
Round duration - 50 minutes
Round difficulty - Medium
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process
Track the time taken to rot all oranges and return it
If any fresh oranges remain after simulation, return -1
Handle edge cases like empty grid or no fresh oranges
Round duration - 90 minutes
Round difficulty - Medium
Splitwise is a system for managing shared expenses among groups of people.
1. Allow users to create groups and add members to track shared expenses.
2. Implement features for adding expenses, specifying who paid and who owes.
3. Calculate balances for each member and settle debts efficiently.
4. Provide notifications and reminders for pending payments.
5. Ensure security and privacy of user data.
6. Implement features like e...
Tip 1 : Practice Leetcode medium questions(top ones from all the popular topics)
Tip 2 : Have good hold of System design questions and practice all the commonly asked ones.
Tip 1 : Keep it concise
Tip 2 : Make sure to include the keywords/tech stack that the particular opening is looking out for
I was interviewed in Mar 2021.
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
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
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
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...
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.
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
Tip 1 : Understand in and out of recursion
Tip 2 : Be consistent - solve 2-3 problems a day, start from easy level
Tip 1 : Make sure your resume reflect what you have acheived on your work front
Tip 2 : Your work experience should be on top and should be detailed along with figures( like improved page load speed by 2.5x, etc)
I was interviewed in Dec 2020.
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.
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...
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...
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.
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
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 beg...
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.
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.
Tip 1 : Practice daily 4-5 medium level problems on sites like Leetcode, CodeZen, Hackerearth
Tip 2 : Even though Data Structures and Algorithms is the base but study Course Subjects like DBMS,OS,OOPS too.
Tip 3 : Try to Participate in Contests on LeetCode,Codeforces.
Tip 1 : Mention the projects you worked on in your past work experience and how it helped your company.
Tip 2 : Keep your resume up to date in accordance with the role you are applying for
Tip 3 : Don't put false things on your resume.
Top trending discussions
Some of the top questions asked at the Tower Research Capital LLC interview -
based on 5 interviews
Interview experience
based on 16 reviews
Rating in categories
Software Engineer
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Sde1
25
salaries
| ₹0 L/yr - ₹0 L/yr |
SDE (Software Development Engineer)
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Jane Street
Optiver
Indian Molasses Company
SIG Plc