Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Feb 2023. There were 3 interview rounds.
posted on 26 Jun 2017
I appeared for an interview before Jun 2016.
The question asks to construct a k-ary tree using the given k and DFS traversal string.
Iterate through the DFS traversal string
If the current character is 'P', create a parent node
If the current character is 'L', create a leaf node
Link the nodes according to the DFS traversal order
To determine if a graph has a node with n degree, iterate through all nodes and count their edges.
Iterate through each node in the graph
Count the number of edges connected to each node
If any node has n edges, then the graph has a node with n degree
I applied via Recruitment Consultant and was interviewed before Dec 2020. There were 3 interview rounds.
posted on 28 May 2022
I appeared for an interview 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.
posted on 29 Dec 2022
I applied via Referral and was interviewed in Nov 2022. There were 2 interview rounds.
I applied via Referral and was interviewed before May 2023. There was 1 interview round.
I applied via Indeed and was interviewed in Nov 2024. There was 1 interview round.
based on 1 interview
Interview experience
Chief Manager
15
salaries
| ₹7 L/yr - ₹21 L/yr |
Manager
5
salaries
| ₹4.5 L/yr - ₹9.6 L/yr |
Assistant Vice President
5
salaries
| ₹31.6 L/yr - ₹40 L/yr |
AVP
5
salaries
| ₹14 L/yr - ₹35 L/yr |
Senior Accounts Executive
4
salaries
| ₹3.5 L/yr - ₹5 L/yr |
Nomura Holdings
Blackrock
Muthoot Homefin India
Adarsh Credit Co-Operative Society