Filter interviews by
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 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
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.
Top trending discussions
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 17 Jan 2023
posted on 15 Oct 2024
I was interviewed before Oct 2023.
Design a working nodejs portfolio platform with api's and some condition
I applied via Company Website and was interviewed in Sep 2023. There were 3 interview rounds.
Hackerrank questions which are not hard to complete, both are to implement functions of a class. LC medium level. After completing both questions still reject
posted on 4 Jul 2024
I applied via Monster and was interviewed before Jul 2023. There was 1 interview round.
Aptitude test question for credit Agricole company
I applied via Recruitment Consulltant and was interviewed before Jun 2022. There were 4 interview rounds.
Designing an e2e payment system with detailed component explanation
1. Define user roles and permissions (e.g. customer, merchant, admin)
2. Implement secure payment gateway integration (e.g. Stripe, PayPal)
3. Develop user-friendly interfaces for payment processing
4. Ensure data encryption and compliance with PCI DSS standards
5. Set up automated payment notifications and transaction tracking
Software Engineer
33
salaries
| ₹14 L/yr - ₹50 L/yr |
Software Developer
25
salaries
| ₹24 L/yr - ₹70 L/yr |
Sde1
25
salaries
| ₹30 L/yr - ₹60 L/yr |
Senior Software Engineer
17
salaries
| ₹35 L/yr - ₹72 L/yr |
SDE (Software Development Engineer)
17
salaries
| ₹35 L/yr - ₹50 L/yr |
Jane Street
Optiver
Indian Molasses Company
SIG Plc