Filter interviews by
30 mins was good sr engirneer was good andpolite wentwell
Binary search is important for efficient searching and sorting. Maps are implemented using hash tables.
Binary search reduces the search space by half with each iteration, making it faster than linear search.
Maps are implemented using hash tables which use a hash function to map keys to indices in an array.
Hash tables provide constant time complexity for insertion, deletion, and retrieval of key-value pairs.
Collision re...
Top trending discussions
2 coding questions based on DSA.
I applied via Social media and was interviewed in Mar 2023. There were 4 interview rounds.
Must contain some questions which will be considered as a qualifier test for next round .it will have some passout marks to get into a next round .
posted on 28 May 2022
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.
We will check all the possible ways of buying and selling stocks. We will fix the time we are buying the stock and check all the possible minutes we can sell this stock and update the maximum profit we can get. Now we will take the maximum profit for all the possible buying time and that would be our final maximum profit.
Algorithm:
Round duration - 60 Minutes
Round difficulty - Medium
If we observe the given problem, we can model it in a graph, specifically a bipartite graph - G (X, Y), where ‘X’ is a vertex set of boys and ‘Y’ is vertex set of girls, and there an edge between a girl and boy if they can dance together. Now we just need to find a set with a maximum number of edges such that no two edges in the set have a common vertex. Here, we will use the concept of Maximum Bipartite...
Multiprocessing vs multithreading
Round duration - 60 Minutes
Round difficulty - Hard
Describe classes and functions for the design of Splitwise.
Tip 1 : Read different designs for different products.
Round duration - 60 Minutes
Round difficulty - Hard
Given that an API service is responding slower than usual, what steps will you take to figure out the problem?
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 17 Jan 2023
I applied via Company Website and was interviewed in Jan 2023. There were 4 interview rounds.
What is the company role and what going on this company
What is the salary in this company
What is the coding test I don't know pls give me explain
posted on 26 Jun 2017
I was interviewed 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 Campus Placement and was interviewed in Sep 2022. There were 2 interview rounds.
Logic base questions minimum 30
Two coding questions in one hr
I applied via LinkedIn and was interviewed in Mar 2022. There were 2 interview rounds.
Relationship Manager
49
salaries
| ₹1.4 L/yr - ₹5.5 L/yr |
Branch Manager
30
salaries
| ₹3.7 L/yr - ₹8.4 L/yr |
Back Office Executive
23
salaries
| ₹1.4 L/yr - ₹3.2 L/yr |
Business Development Executive
21
salaries
| ₹1 L/yr - ₹3.5 L/yr |
Team Lead
11
salaries
| ₹1.5 L/yr - ₹4.7 L/yr |
Angel One
Sharekhan
Kotak Securities
Motilal Oswal Financial Services