Filter interviews by
I applied via Referral
Hashmap problem involving storing and retrieving data efficiently.
Hashmap is a data structure that stores key-value pairs.
It allows for fast retrieval of values based on keys.
Examples include storing student grades by student ID, or mapping employee names to their salaries.
Top trending discussions
posted on 3 Dec 2015
I was interviewed before May 2016.
posted on 20 Jan 2015
The code inserts a given string at the specified position in a compact data structure that stores strings sequentially.
To insert the string at the ith place, we need to shift all the strings after the ith position by the length of the new string.
We can use a loop to iterate through the data structure and find the ith position.
After finding the ith position, we can calculate the new length of the data structure and allo...
Constructing parse tree for ((a+b)*c)/d using data structures.
Use stack data structure to keep track of operators and operands.
Start with the innermost parentheses and work outwards.
Create a node for each operator and operand and link them together.
The root node will be the final result of the expression.
Example: ((a+b)*c)/d can be represented as / -> * -> + -> a, b, c, d.
Merge 'n' identical linked lists from 'n' salespersons to handle insertions, deletions, and updates.
Iterate through each linked list and merge them into a single linked list
Handle insertions, deletions, and updates by traversing the merged list and making necessary changes
Repeat the process for the next day by resetting the merged list
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
based on 1 interview
Interview experience
based on 6 reviews
Rating in categories
Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Program Manager 2
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Microsoft Corporation
Apple
Samsung